./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:36:44,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:36:44,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:36:44,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:36:44,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:36:45,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:36:45,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:36:45,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:36:45,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:36:45,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:36:45,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:36:45,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:36:45,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:36:45,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:36:45,011 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:36:45,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:36:45,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:36:45,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:36:45,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:36:45,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:36:45,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:36:45,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:36:45,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:36:45,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:36:45,013 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:36:45,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:36:45,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:36:45,013 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:36:45,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:36:45,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:36:45,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:36:45,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:36:45,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:36:45,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:36:45,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:36:45,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:36:45,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:36:45,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:36:45,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:36:45,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:36:45,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:36:45,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:36:45,016 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2024-11-07 07:36:45,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:36:45,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:36:45,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:36:45,318 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:36:45,318 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:36:45,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-07 07:36:46,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:36:46,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:36:46,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-07 07:36:46,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ede416373/687bdb8144de4ac58f392cf318da79bb/FLAG262010654 [2024-11-07 07:36:47,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ede416373/687bdb8144de4ac58f392cf318da79bb [2024-11-07 07:36:47,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:36:47,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:36:47,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:36:47,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:36:47,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:36:47,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d985fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47, skipping insertion in model container [2024-11-07 07:36:47,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:36:47,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-11-07 07:36:47,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:36:47,237 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:36:47,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-11-07 07:36:47,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:36:47,277 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:36:47,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47 WrapperNode [2024-11-07 07:36:47,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:36:47,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:36:47,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:36:47,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:36:47,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,352 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-11-07 07:36:47,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:36:47,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:36:47,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:36:47,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:36:47,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,390 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:36:47,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:36:47,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:36:47,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:36:47,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:36:47,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (1/1) ... [2024-11-07 07:36:47,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:36:47,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:36:47,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:36:47,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:36:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:36:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:36:47,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:36:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:36:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:36:47,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:36:47,559 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:36:47,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:36:47,858 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-07 07:36:47,858 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:36:47,868 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:36:47,869 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:36:47,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:36:47 BoogieIcfgContainer [2024-11-07 07:36:47,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:36:47,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:36:47,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:36:47,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:36:47,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:36:47" (1/3) ... [2024-11-07 07:36:47,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361977fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:36:47, skipping insertion in model container [2024-11-07 07:36:47,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:36:47" (2/3) ... [2024-11-07 07:36:47,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@361977fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:36:47, skipping insertion in model container [2024-11-07 07:36:47,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:36:47" (3/3) ... [2024-11-07 07:36:47,895 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-07 07:36:47,908 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:36:47,909 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:36:47,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:36:47,972 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5999493e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:36:47,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:36:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:36:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 07:36:47,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:47,989 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:47,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:47,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash 123038288, now seen corresponding path program 1 times [2024-11-07 07:36:48,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:48,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856413891] [2024-11-07 07:36:48,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856413891] [2024-11-07 07:36:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856413891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:48,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:48,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:36:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947329158] [2024-11-07 07:36:48,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:48,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:36:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:36:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:36:48,322 INFO L87 Difference]: Start difference. First operand has 66 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 07:36:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:48,341 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2024-11-07 07:36:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:36:48,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2024-11-07 07:36:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:48,348 INFO L225 Difference]: With dead ends: 125 [2024-11-07 07:36:48,348 INFO L226 Difference]: Without dead ends: 62 [2024-11-07 07:36:48,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:36:48,352 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:48,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:36:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-07 07:36:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-07 07:36:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:36:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2024-11-07 07:36:48,381 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 74 [2024-11-07 07:36:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:48,381 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2024-11-07 07:36:48,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 07:36:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2024-11-07 07:36:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 07:36:48,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:48,384 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:48,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:36:48,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:48,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1283939178, now seen corresponding path program 1 times [2024-11-07 07:36:48,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:48,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412713437] [2024-11-07 07:36:48,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:48,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:48,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412713437] [2024-11-07 07:36:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412713437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:48,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:36:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611012146] [2024-11-07 07:36:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:48,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:36:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:36:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:36:48,718 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:48,748 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2024-11-07 07:36:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:36:48,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-11-07 07:36:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:48,751 INFO L225 Difference]: With dead ends: 122 [2024-11-07 07:36:48,752 INFO L226 Difference]: Without dead ends: 63 [2024-11-07 07:36:48,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:36:48,754 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:48,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:36:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-07 07:36:48,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-07 07:36:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:36:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2024-11-07 07:36:48,764 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 74 [2024-11-07 07:36:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:48,766 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2024-11-07 07:36:48,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-11-07 07:36:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 07:36:48,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:48,767 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:48,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:36:48,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:48,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:48,768 INFO L85 PathProgramCache]: Analyzing trace with hash -603880808, now seen corresponding path program 1 times [2024-11-07 07:36:48,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:48,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272897345] [2024-11-07 07:36:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:48,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:48,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272897345] [2024-11-07 07:36:48,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272897345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:48,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:48,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:36:48,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308045941] [2024-11-07 07:36:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:48,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:36:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:36:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:36:48,982 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:49,227 INFO L93 Difference]: Finished difference Result 148 states and 214 transitions. [2024-11-07 07:36:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:36:49,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-11-07 07:36:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:49,230 INFO L225 Difference]: With dead ends: 148 [2024-11-07 07:36:49,231 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 07:36:49,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:36:49,233 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 85 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:49,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:36:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 07:36:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2024-11-07 07:36:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:36:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-11-07 07:36:49,243 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 74 [2024-11-07 07:36:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:49,244 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-11-07 07:36:49,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-07 07:36:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 07:36:49,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:49,248 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:49,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:36:49,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:49,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash -345715370, now seen corresponding path program 1 times [2024-11-07 07:36:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:49,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634332423] [2024-11-07 07:36:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:51,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:51,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634332423] [2024-11-07 07:36:51,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634332423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:51,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:51,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:36:51,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396852491] [2024-11-07 07:36:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:51,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:36:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:51,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:36:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:36:51,499 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:52,208 INFO L93 Difference]: Finished difference Result 268 states and 388 transitions. [2024-11-07 07:36:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:36:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-11-07 07:36:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:52,211 INFO L225 Difference]: With dead ends: 268 [2024-11-07 07:36:52,211 INFO L226 Difference]: Without dead ends: 206 [2024-11-07 07:36:52,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:36:52,212 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 363 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:52,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 280 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 07:36:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-07 07:36:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 89. [2024-11-07 07:36:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:36:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-11-07 07:36:52,231 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 74 [2024-11-07 07:36:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:52,232 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-11-07 07:36:52,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-11-07 07:36:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 07:36:52,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:52,233 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:52,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:36:52,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:52,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:52,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1955107220, now seen corresponding path program 1 times [2024-11-07 07:36:52,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:52,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140192175] [2024-11-07 07:36:52,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:52,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:52,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140192175] [2024-11-07 07:36:52,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140192175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:52,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:52,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 07:36:52,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207567122] [2024-11-07 07:36:52,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:52,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:36:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:52,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:36:52,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:36:52,756 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:53,075 INFO L93 Difference]: Finished difference Result 207 states and 301 transitions. [2024-11-07 07:36:53,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 07:36:53,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-11-07 07:36:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:53,077 INFO L225 Difference]: With dead ends: 207 [2024-11-07 07:36:53,078 INFO L226 Difference]: Without dead ends: 121 [2024-11-07 07:36:53,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:36:53,079 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:53,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 204 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:36:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-07 07:36:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2024-11-07 07:36:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:36:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2024-11-07 07:36:53,088 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 74 [2024-11-07 07:36:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:53,089 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2024-11-07 07:36:53,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2024-11-07 07:36:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 07:36:53,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:53,090 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:53,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:36:53,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:53,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash 212492637, now seen corresponding path program 1 times [2024-11-07 07:36:53,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:53,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318277355] [2024-11-07 07:36:53,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:53,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,185 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:53,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:53,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318277355] [2024-11-07 07:36:53,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318277355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:53,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:53,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:36:53,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670394998] [2024-11-07 07:36:53,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:53,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:36:53,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:53,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:36:53,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:36:53,187 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:53,247 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-11-07 07:36:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:36:53,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2024-11-07 07:36:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:53,249 INFO L225 Difference]: With dead ends: 196 [2024-11-07 07:36:53,250 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 07:36:53,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:36:53,253 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 54 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:53,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 183 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:36:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 07:36:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2024-11-07 07:36:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:36:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-07 07:36:53,269 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 75 [2024-11-07 07:36:53,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:53,270 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-07 07:36:53,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-07 07:36:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 07:36:53,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:53,271 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:53,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:36:53,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:53,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2016158326, now seen corresponding path program 1 times [2024-11-07 07:36:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:53,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190875385] [2024-11-07 07:36:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190875385] [2024-11-07 07:36:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190875385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:53,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:53,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:36:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366262903] [2024-11-07 07:36:53,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:53,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:36:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:53,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:36:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:36:53,361 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:53,406 INFO L93 Difference]: Finished difference Result 207 states and 295 transitions. [2024-11-07 07:36:53,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:36:53,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2024-11-07 07:36:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:53,407 INFO L225 Difference]: With dead ends: 207 [2024-11-07 07:36:53,407 INFO L226 Difference]: Without dead ends: 120 [2024-11-07 07:36:53,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:36:53,408 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 75 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:53,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 143 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:36:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-07 07:36:53,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2024-11-07 07:36:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:36:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-11-07 07:36:53,417 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 75 [2024-11-07 07:36:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:53,418 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-11-07 07:36:53,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-11-07 07:36:53,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 07:36:53,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:53,422 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:53,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:36:53,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:53,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash -31631447, now seen corresponding path program 1 times [2024-11-07 07:36:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:53,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264854546] [2024-11-07 07:36:53,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:53,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:53,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264854546] [2024-11-07 07:36:53,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264854546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:53,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:53,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:36:53,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694915316] [2024-11-07 07:36:53,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:53,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:36:53,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:53,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:36:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:36:53,547 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:53,793 INFO L93 Difference]: Finished difference Result 241 states and 333 transitions. [2024-11-07 07:36:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 07:36:53,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2024-11-07 07:36:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:53,796 INFO L225 Difference]: With dead ends: 241 [2024-11-07 07:36:53,796 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 07:36:53,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:36:53,798 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 201 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:53,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 314 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:36:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 07:36:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2024-11-07 07:36:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 137 states have internal predecessors, (180), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 07:36:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 220 transitions. [2024-11-07 07:36:53,829 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 220 transitions. Word has length 76 [2024-11-07 07:36:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:53,830 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 220 transitions. [2024-11-07 07:36:53,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 220 transitions. [2024-11-07 07:36:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 07:36:53,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:53,831 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:53,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:36:53,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:53,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash -618437461, now seen corresponding path program 1 times [2024-11-07 07:36:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859409048] [2024-11-07 07:36:53,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:54,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859409048] [2024-11-07 07:36:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859409048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:54,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:54,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:36:54,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172035471] [2024-11-07 07:36:54,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:54,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:36:54,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:36:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:36:54,858 INFO L87 Difference]: Start difference. First operand 160 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:55,655 INFO L93 Difference]: Finished difference Result 467 states and 645 transitions. [2024-11-07 07:36:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:36:55,656 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2024-11-07 07:36:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:55,660 INFO L225 Difference]: With dead ends: 467 [2024-11-07 07:36:55,660 INFO L226 Difference]: Without dead ends: 314 [2024-11-07 07:36:55,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:36:55,661 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 265 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:55,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 331 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 07:36:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-07 07:36:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 180. [2024-11-07 07:36:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 157 states have internal predecessors, (209), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 07:36:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 249 transitions. [2024-11-07 07:36:55,681 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 249 transitions. Word has length 76 [2024-11-07 07:36:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:55,681 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 249 transitions. [2024-11-07 07:36:55,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 249 transitions. [2024-11-07 07:36:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 07:36:55,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:55,683 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:55,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:36:55,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:55,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1436085911, now seen corresponding path program 1 times [2024-11-07 07:36:55,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:55,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208475751] [2024-11-07 07:36:55,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:36:55,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:55,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208475751] [2024-11-07 07:36:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208475751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:36:55,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:36:55,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:36:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711563565] [2024-11-07 07:36:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:36:55,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:36:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:36:55,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:36:55,799 INFO L87 Difference]: Start difference. First operand 180 states and 249 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:55,877 INFO L93 Difference]: Finished difference Result 504 states and 698 transitions. [2024-11-07 07:36:55,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:36:55,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2024-11-07 07:36:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:55,880 INFO L225 Difference]: With dead ends: 504 [2024-11-07 07:36:55,880 INFO L226 Difference]: Without dead ends: 331 [2024-11-07 07:36:55,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:36:55,881 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:55,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 174 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:36:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-07 07:36:55,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 260. [2024-11-07 07:36:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 224 states have (on average 1.3348214285714286) internal successors, (299), 226 states have internal predecessors, (299), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 07:36:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 357 transitions. [2024-11-07 07:36:55,905 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 357 transitions. Word has length 76 [2024-11-07 07:36:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:55,905 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 357 transitions. [2024-11-07 07:36:55,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:36:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 357 transitions. [2024-11-07 07:36:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 07:36:55,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:55,907 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:55,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:36:55,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1752940520, now seen corresponding path program 1 times [2024-11-07 07:36:55,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:55,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278259851] [2024-11-07 07:36:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:36:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:36:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:36:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:36:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:36:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 07:36:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 07:36:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 07:36:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 07:36:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 07:36:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:36:56,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278259851] [2024-11-07 07:36:56,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278259851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:36:56,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311759778] [2024-11-07 07:36:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:56,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:36:56,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:36:56,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:36:56,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 07:36:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:36:56,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 07:36:56,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:36:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 07:36:56,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:36:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 07:36:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311759778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:36:56,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:36:56,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-11-07 07:36:56,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654257361] [2024-11-07 07:36:56,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:36:56,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 07:36:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:36:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 07:36:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:36:56,607 INFO L87 Difference]: Start difference. First operand 260 states and 357 transitions. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-07 07:36:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:36:57,240 INFO L93 Difference]: Finished difference Result 872 states and 1163 transitions. [2024-11-07 07:36:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 07:36:57,241 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 77 [2024-11-07 07:36:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:36:57,247 INFO L225 Difference]: With dead ends: 872 [2024-11-07 07:36:57,247 INFO L226 Difference]: Without dead ends: 768 [2024-11-07 07:36:57,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2024-11-07 07:36:57,249 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1031 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 07:36:57,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 712 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 07:36:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-07 07:36:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 278. [2024-11-07 07:36:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 220 states have (on average 1.2636363636363637) internal successors, (278), 221 states have internal predecessors, (278), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 07:36:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 368 transitions. [2024-11-07 07:36:57,302 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 368 transitions. Word has length 77 [2024-11-07 07:36:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:36:57,302 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 368 transitions. [2024-11-07 07:36:57,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-07 07:36:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 368 transitions. [2024-11-07 07:36:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 07:36:57,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:36:57,304 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:57,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:36:57,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 07:36:57,509 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:36:57,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:36:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1330238694, now seen corresponding path program 1 times [2024-11-07 07:36:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:36:57,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916395397] [2024-11-07 07:36:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:36:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:36:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:36:57,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:36:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:36:57,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:36:57,595 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:36:57,596 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:36:57,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 07:36:57,601 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:36:57,671 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:36:57,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:36:57 BoogieIcfgContainer [2024-11-07 07:36:57,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:36:57,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:36:57,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:36:57,677 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:36:57,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:36:47" (3/4) ... [2024-11-07 07:36:57,680 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:36:57,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:36:57,682 INFO L158 Benchmark]: Toolchain (without parser) took 10668.70ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 76.4MB in the beginning and 150.7MB in the end (delta: -74.3MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-11-07 07:36:57,682 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:36:57,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.47ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 63.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:36:57,683 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.86ms. Allocated memory is still 100.7MB. Free memory was 63.6MB in the beginning and 60.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:36:57,683 INFO L158 Benchmark]: Boogie Preprocessor took 68.30ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 58.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:36:57,684 INFO L158 Benchmark]: RCFGBuilder took 446.99ms. Allocated memory is still 100.7MB. Free memory was 58.0MB in the beginning and 38.1MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:36:57,684 INFO L158 Benchmark]: TraceAbstraction took 9789.40ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 75.6MB in the beginning and 150.7MB in the end (delta: -75.2MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-11-07 07:36:57,685 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 226.5MB. Free memory was 150.7MB in the beginning and 150.7MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:36:57,687 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.47ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 63.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.86ms. Allocated memory is still 100.7MB. Free memory was 63.6MB in the beginning and 60.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.30ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 58.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 446.99ms. Allocated memory is still 100.7MB. Free memory was 58.0MB in the beginning and 38.1MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9789.40ms. Allocated memory was 100.7MB in the beginning and 226.5MB in the end (delta: 125.8MB). Free memory was 75.6MB in the beginning and 150.7MB in the end (delta: -75.2MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 226.5MB. Free memory was 150.7MB in the beginning and 150.7MB in the end (delta: 29.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; VAL [isInitial=0, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2283 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2275 mSDsluCounter, 2878 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1946 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1835 IncrementalHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 932 mSDtfsCounter, 1835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 959 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 4575 SizeOfPredicates, 4 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 1800/1872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 07:36:57,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:36:59,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:37:00,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:37:00,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:37:00,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:37:00,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:37:00,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:37:00,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:37:00,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:37:00,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:37:00,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:37:00,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:37:00,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:37:00,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:37:00,140 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:37:00,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:37:00,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:37:00,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:37:00,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:37:00,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:37:00,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:37:00,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:37:00,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:37:00,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:37:00,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:37:00,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:37:00,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:37:00,142 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:37:00,142 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:37:00,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:37:00,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:37:00,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:37:00,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:37:00,142 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2024-11-07 07:37:00,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:37:00,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:37:00,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:37:00,463 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:37:00,464 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:37:00,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-07 07:37:01,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:37:02,239 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:37:02,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-07 07:37:02,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/056195234/08107dcf93694b2ba9e80f7f4e3d2b26/FLAGf81ceb022 [2024-11-07 07:37:02,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/056195234/08107dcf93694b2ba9e80f7f4e3d2b26 [2024-11-07 07:37:02,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:37:02,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:37:02,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:37:02,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:37:02,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:37:02,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6783b3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02, skipping insertion in model container [2024-11-07 07:37:02,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:37:02,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-11-07 07:37:02,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:37:02,476 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:37:02,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2024-11-07 07:37:02,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:37:02,524 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:37:02,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02 WrapperNode [2024-11-07 07:37:02,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:37:02,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:37:02,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:37:02,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:37:02,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,567 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-07 07:37:02,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:37:02,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:37:02,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:37:02,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:37:02,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,588 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:37:02,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:37:02,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:37:02,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:37:02,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:37:02,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (1/1) ... [2024-11-07 07:37:02,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:37:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:37:02,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:37:02,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:37:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:37:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:37:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:37:02,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:37:02,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:37:02,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:37:02,736 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:37:02,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:37:03,299 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 07:37:03,299 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:37:03,310 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:37:03,311 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:37:03,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:37:03 BoogieIcfgContainer [2024-11-07 07:37:03,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:37:03,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:37:03,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:37:03,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:37:03,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:37:02" (1/3) ... [2024-11-07 07:37:03,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698b0971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:37:03, skipping insertion in model container [2024-11-07 07:37:03,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:37:02" (2/3) ... [2024-11-07 07:37:03,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698b0971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:37:03, skipping insertion in model container [2024-11-07 07:37:03,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:37:03" (3/3) ... [2024-11-07 07:37:03,325 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2024-11-07 07:37:03,339 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:37:03,339 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:37:03,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:37:03,394 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39cbf031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:37:03,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:37:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:37:03,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 07:37:03,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:03,405 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:03,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:03,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash -222403520, now seen corresponding path program 1 times [2024-11-07 07:37:03,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:37:03,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888067596] [2024-11-07 07:37:03,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:03,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:03,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:37:03,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:37:03,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 07:37:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:03,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:37:03,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:37:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-07 07:37:03,672 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:37:03,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:37:03,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888067596] [2024-11-07 07:37:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888067596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:37:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:37:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:37:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949237722] [2024-11-07 07:37:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:37:03,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:37:03,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:37:03,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:37:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:37:03,700 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 07:37:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:37:03,716 INFO L93 Difference]: Finished difference Result 75 states and 117 transitions. [2024-11-07 07:37:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:37:03,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-11-07 07:37:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:37:03,722 INFO L225 Difference]: With dead ends: 75 [2024-11-07 07:37:03,722 INFO L226 Difference]: Without dead ends: 37 [2024-11-07 07:37:03,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:37:03,726 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:37:03,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:37:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-07 07:37:03,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-07 07:37:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:37:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-07 07:37:03,754 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-11-07 07:37:03,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:37:03,754 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-07 07:37:03,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 07:37:03,755 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-07 07:37:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 07:37:03,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:03,757 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:03,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 07:37:03,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:03,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:03,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1057703046, now seen corresponding path program 1 times [2024-11-07 07:37:03,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:37:03,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384996135] [2024-11-07 07:37:03,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:03,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:03,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:37:03,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:37:03,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 07:37:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:04,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:37:04,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:37:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 07:37:04,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:37:04,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:37:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384996135] [2024-11-07 07:37:04,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384996135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:37:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1167864412] [2024-11-07 07:37:04,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:04,897 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 07:37:04,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 07:37:04,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 07:37:04,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-07 07:37:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:05,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 07:37:05,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:37:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 07:37:05,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:37:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1167864412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:37:05,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 07:37:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-11-07 07:37:05,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72915565] [2024-11-07 07:37:05,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:37:05,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:37:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:37:05,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:37:05,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 07:37:05,479 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:37:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:37:05,891 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2024-11-07 07:37:05,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:37:05,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2024-11-07 07:37:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:37:05,893 INFO L225 Difference]: With dead ends: 96 [2024-11-07 07:37:05,893 INFO L226 Difference]: Without dead ends: 62 [2024-11-07 07:37:05,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:37:05,895 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 41 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:37:05,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 210 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:37:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-07 07:37:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2024-11-07 07:37:05,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 07:37:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-11-07 07:37:05,907 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 66 [2024-11-07 07:37:05,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:37:05,907 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-11-07 07:37:05,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 07:37:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-11-07 07:37:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 07:37:05,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:05,911 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:05,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 07:37:06,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-07 07:37:06,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 07:37:06,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:06,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:06,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1116808390, now seen corresponding path program 1 times [2024-11-07 07:37:06,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:37:06,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826178466] [2024-11-07 07:37:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:06,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:37:06,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:37:06,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 07:37:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:06,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:37:06,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:37:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 07:37:06,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:37:06,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:37:06,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826178466] [2024-11-07 07:37:06,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826178466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:37:06,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [514254557] [2024-11-07 07:37:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:06,953 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 07:37:06,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 07:37:06,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 07:37:06,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 07:37:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:07,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 07:37:07,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:37:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 07:37:07,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:37:07,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [514254557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:37:07,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:37:07,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-07 07:37:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538868352] [2024-11-07 07:37:07,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:37:07,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:37:07,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:37:07,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:37:07,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:37:07,773 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 07:37:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:37:08,537 INFO L93 Difference]: Finished difference Result 112 states and 144 transitions. [2024-11-07 07:37:08,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:37:08,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-11-07 07:37:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:37:08,545 INFO L225 Difference]: With dead ends: 112 [2024-11-07 07:37:08,545 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 07:37:08,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:37:08,546 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:37:08,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 07:37:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 07:37:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2024-11-07 07:37:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:37:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2024-11-07 07:37:08,561 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 66 [2024-11-07 07:37:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:37:08,562 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2024-11-07 07:37:08,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 07:37:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2024-11-07 07:37:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 07:37:08,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:37:08,563 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:37:08,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-07 07:37:08,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 07:37:08,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:08,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:37:08,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:37:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash 723781380, now seen corresponding path program 1 times [2024-11-07 07:37:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:37:08,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887894794] [2024-11-07 07:37:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:37:08,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:37:08,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:37:08,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:37:08,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 07:37:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:37:09,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 07:37:09,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:37:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-07 07:37:58,491 INFO L311 TraceCheckSpWp]: Computing backward predicates...