./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.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_operatoramount_amount25_file-84.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', '994073aed62012ba91afecda0f9cff5d1ecbbdeeb1f3f6d5d749c5bccdadcd29'] 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_operatoramount_amount25_file-84.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 994073aed62012ba91afecda0f9cff5d1ecbbdeeb1f3f6d5d749c5bccdadcd29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:35:37,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:35:37,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 09:35:37,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:35:37,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:35:37,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:35:37,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:35:37,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:35:37,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:35:37,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:35:37,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:35:37,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:35:37,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:35:37,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:35:37,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:35:37,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:35:37,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:35:37,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 09:35:37,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 09:35:37,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:35:37,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:35:37,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:35:37,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:35:37,181 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 -> 994073aed62012ba91afecda0f9cff5d1ecbbdeeb1f3f6d5d749c5bccdadcd29 [2024-11-07 09:35:37,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:35:37,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:35:37,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:35:37,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:35:37,514 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:35:37,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i [2024-11-07 09:35:38,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:35:39,084 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:35:39,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i [2024-11-07 09:35:39,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a54748c6/45954eb5fe054738b5735b1f518319f3/FLAG52aaca05d [2024-11-07 09:35:39,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5a54748c6/45954eb5fe054738b5735b1f518319f3 [2024-11-07 09:35:39,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:35:39,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:35:39,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:35:39,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:35:39,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:35:39,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e36e642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39, skipping insertion in model container [2024-11-07 09:35:39,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:35:39,306 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_operatoramount_amount25_file-84.i[915,928] [2024-11-07 09:35:39,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:35:39,382 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:35:39,395 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_operatoramount_amount25_file-84.i[915,928] [2024-11-07 09:35:39,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:35:39,464 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:35:39,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39 WrapperNode [2024-11-07 09:35:39,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:35:39,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:35:39,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:35:39,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:35:39,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,534 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-07 09:35:39,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:35:39,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:35:39,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:35:39,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:35:39,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,576 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 09:35:39,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:35:39,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:35:39,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:35:39,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:35:39,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (1/1) ... [2024-11-07 09:35:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:35:39,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:35:39,650 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 09:35:39,656 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 09:35:39,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:35:39,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:35:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:35:39,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 09:35:39,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:35:39,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:35:39,760 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:35:39,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:35:40,051 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 09:35:40,052 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:35:40,077 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:35:40,078 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:35:40,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:35:40 BoogieIcfgContainer [2024-11-07 09:35:40,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:35:40,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:35:40,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:35:40,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:35:40,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:35:39" (1/3) ... [2024-11-07 09:35:40,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35db9bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:35:40, skipping insertion in model container [2024-11-07 09:35:40,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:39" (2/3) ... [2024-11-07 09:35:40,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35db9bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:35:40, skipping insertion in model container [2024-11-07 09:35:40,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:35:40" (3/3) ... [2024-11-07 09:35:40,090 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-84.i [2024-11-07 09:35:40,106 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:35:40,107 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:35:40,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:35:40,195 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;@4d26e5ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:35:40,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:35:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:35:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 09:35:40,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:35:40,213 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:40,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:35:40,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:35:40,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1290669553, now seen corresponding path program 1 times [2024-11-07 09:35:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:35:40,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670851008] [2024-11-07 09:35:40,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:35:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:35:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:35:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:35:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:35:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:35:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:35:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:35:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:35:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:35:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:35:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 09:35:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:35:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 09:35:40,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:35:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670851008] [2024-11-07 09:35:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670851008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:35:40,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:35:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:35:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58895207] [2024-11-07 09:35:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:35:40,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:35:40,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:35:40,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:35:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:35:40,556 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 09:35:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:35:40,580 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2024-11-07 09:35:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:35:40,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-07 09:35:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:35:40,588 INFO L225 Difference]: With dead ends: 81 [2024-11-07 09:35:40,588 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 09:35:40,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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 09:35:40,595 INFO L432 NwaCegarLoop]: 55 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, 55 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 09:35:40,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:35:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 09:35:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-07 09:35:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:35:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-07 09:35:40,639 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 76 [2024-11-07 09:35:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:35:40,640 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-07 09:35:40,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 09:35:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-07 09:35:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 09:35:40,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:35:40,646 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:40,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 09:35:40,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:35:40,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:35:40,647 INFO L85 PathProgramCache]: Analyzing trace with hash -311629705, now seen corresponding path program 1 times [2024-11-07 09:35:40,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:35:40,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155097200] [2024-11-07 09:35:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:35:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:35:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 09:35:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 09:35:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 09:35:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 09:35:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 09:35:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 09:35:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 09:35:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 09:35:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 09:35:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 09:35:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 09:35:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 09:35:40,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 09:35:40,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155097200] [2024-11-07 09:35:40,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155097200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:35:40,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:35:40,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:35:40,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848211172] [2024-11-07 09:35:40,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:35:40,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:35:40,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 09:35:40,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:35:40,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:35:40,961 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 09:35:40,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:35:40,989 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-11-07 09:35:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:35:40,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2024-11-07 09:35:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:35:40,992 INFO L225 Difference]: With dead ends: 77 [2024-11-07 09:35:40,992 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 09:35:40,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 09:35:40,993 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 09:35:40,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:35:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 09:35:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-07 09:35:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:35:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-07 09:35:41,000 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 76 [2024-11-07 09:35:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:35:41,004 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-07 09:35:41,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 09:35:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-07 09:35:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 09:35:41,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:35:41,008 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:41,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 09:35:41,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:35:41,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:35:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1463377657, now seen corresponding path program 1 times [2024-11-07 09:35:41,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 09:35:41,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197117822] [2024-11-07 09:35:41,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:35:41,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 09:35:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:35:41,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 09:35:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 09:35:41,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 09:35:41,312 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 09:35:41,313 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 09:35:41,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 09:35:41,317 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 09:35:41,376 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 09:35:41,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:35:41 BoogieIcfgContainer [2024-11-07 09:35:41,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 09:35:41,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 09:35:41,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 09:35:41,381 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 09:35:41,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:35:40" (3/4) ... [2024-11-07 09:35:41,387 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 09:35:41,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 09:35:41,389 INFO L158 Benchmark]: Toolchain (without parser) took 2262.16ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 48.8MB in the end (delta: 27.9MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-07 09:35:41,389 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:35:41,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.19ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 63.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:35:41,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.60ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 60.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:35:41,390 INFO L158 Benchmark]: Boogie Preprocessor took 69.58ms. Allocated memory is still 100.7MB. Free memory was 60.6MB in the beginning and 54.8MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 09:35:41,390 INFO L158 Benchmark]: RCFGBuilder took 472.86ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 76.2MB in the end (delta: -21.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-07 09:35:41,390 INFO L158 Benchmark]: TraceAbstraction took 1298.76ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 48.8MB in the end (delta: 27.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-11-07 09:35:41,390 INFO L158 Benchmark]: Witness Printer took 7.44ms. Allocated memory is still 100.7MB. Free memory was 48.8MB in the beginning and 48.8MB in the end (delta: 12.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 09:35:41,394 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.19ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 63.7MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.60ms. Allocated memory is still 100.7MB. Free memory was 63.7MB in the beginning and 60.6MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.58ms. Allocated memory is still 100.7MB. Free memory was 60.6MB in the beginning and 54.8MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 472.86ms. Allocated memory is still 100.7MB. Free memory was 54.8MB in the beginning and 76.2MB in the end (delta: -21.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1298.76ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 48.8MB in the end (delta: 27.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Witness Printer took 7.44ms. Allocated memory is still 100.7MB. Free memory was 48.8MB in the beginning and 48.8MB in the end (delta: 12.3kB). 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. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] unsigned char var_1_4 = 25; [L24] unsigned char var_1_5 = 64; [L25] unsigned char var_1_6 = 8; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 10; [L28] float var_1_9 = 9.6; [L29] float var_1_10 = 99.08; [L30] float var_1_11 = 63.4; [L31] float var_1_12 = 32.125; [L32] signed long int var_1_13 = -8; [L33] signed short int var_1_14 = -2; VAL [isInitial=0, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=25, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] FCALL updateLastVariables() [L92] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L64] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=64, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L67] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L70] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=0, var_1_8=10, var_1_9=48/5] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_8=10, var_1_9=48/5] [L73] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L73] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=2477/25, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L75] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=317/5, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L77] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=257/8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L78] var_1_12 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L92] RET updateVariables() [L93] CALL step() [L37] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, stepLocal_1=8, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=10, var_1_9=48/5] [L38] COND TRUE var_1_5 > stepLocal_1 [L39] var_1_8 = (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))) VAL [isInitial=1, var_1_13=-8, var_1_14=-2, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L41] var_1_13 = var_1_7 [L42] var_1_14 = var_1_7 [L43] signed short int stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=9, var_1_13=9, var_1_14=9, var_1_1=128, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L44] COND FALSE !(var_1_14 != stepLocal_0) [L47] var_1_1 = ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7))) VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L49] signed long int stepLocal_3 = var_1_13; [L50] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_2=8, stepLocal_3=9, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L51] COND FALSE !((var_1_10 * var_1_11) > 16.75f) VAL [isInitial=1, stepLocal_2=8, stepLocal_3=9, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L93] RET step() [L94] CALL, EXPR property() [L84-L85] return (((((var_1_14 != var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 + ((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)))))) : (var_1_1 == ((unsigned char) ((((((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) < (var_1_7)) ? (((((var_1_4) < (var_1_6)) ? (var_1_4) : (var_1_6)))) : (var_1_7)))))) && ((var_1_5 > var_1_4) ? (var_1_8 == ((unsigned char) (128 - ((((10) > (var_1_5)) ? (10) : (var_1_5)))))) : 1)) && (((var_1_10 * var_1_11) > 16.75f) ? ((var_1_7 <= var_1_1) ? ((-8 > var_1_13) ? (var_1_9 == ((float) var_1_12)) : 1) : (var_1_9 == ((float) var_1_12))) : 1)) && (var_1_13 == ((signed long int) var_1_7))) && (var_1_14 == ((signed short int) var_1_7)) ; VAL [\result=0, isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] [L19] reach_error() VAL [isInitial=1, var_1_13=9, var_1_14=9, var_1_1=8, var_1_4=8, var_1_5=9, var_1_6=8, var_1_7=9, var_1_8=118, var_1_9=48/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 108 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 440/440 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 09:35:41,420 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_operatoramount_amount25_file-84.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 994073aed62012ba91afecda0f9cff5d1ecbbdeeb1f3f6d5d749c5bccdadcd29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 09:35:43,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 09:35:43,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 09:35:43,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 09:35:43,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 09:35:43,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 09:35:43,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 09:35:43,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 09:35:43,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 09:35:43,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 09:35:43,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 09:35:43,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 09:35:43,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 09:35:43,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 09:35:43,808 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 09:35:43,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 09:35:43,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 09:35:43,808 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 09:35:43,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 09:35:43,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 09:35:43,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 09:35:43,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 09:35:43,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 09:35:43,809 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 09:35:43,809 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 09:35:43,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 09:35:43,810 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 09:35:43,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 09:35:43,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 09:35:43,810 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 09:35:43,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 09:35:43,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 09:35:43,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 09:35:43,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 09:35:43,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:35:43,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 09:35:43,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 09:35:43,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 09:35:43,812 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 09:35:43,812 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 09:35:43,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 09:35:43,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 09:35:43,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 09:35:43,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 09:35:43,812 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 -> 994073aed62012ba91afecda0f9cff5d1ecbbdeeb1f3f6d5d749c5bccdadcd29 [2024-11-07 09:35:44,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 09:35:44,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 09:35:44,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 09:35:44,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 09:35:44,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 09:35:44,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i [2024-11-07 09:35:45,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 09:35:45,781 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 09:35:45,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-84.i [2024-11-07 09:35:45,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/251290b64/568a30bdde9d4b6b914bc85ea59c1c53/FLAGe18c5a162 [2024-11-07 09:35:45,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/251290b64/568a30bdde9d4b6b914bc85ea59c1c53 [2024-11-07 09:35:45,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 09:35:45,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 09:35:45,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 09:35:45,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 09:35:45,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 09:35:45,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:35:45" (1/1) ... [2024-11-07 09:35:45,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d12f729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:45, skipping insertion in model container [2024-11-07 09:35:45,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:35:45" (1/1) ... [2024-11-07 09:35:45,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 09:35:46,012 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_operatoramount_amount25_file-84.i[915,928] [2024-11-07 09:35:46,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:35:46,096 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 09:35:46,107 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_operatoramount_amount25_file-84.i[915,928] [2024-11-07 09:35:46,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 09:35:46,156 INFO L204 MainTranslator]: Completed translation [2024-11-07 09:35:46,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46 WrapperNode [2024-11-07 09:35:46,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 09:35:46,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 09:35:46,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 09:35:46,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 09:35:46,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,210 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-07 09:35:46,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 09:35:46,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 09:35:46,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 09:35:46,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 09:35:46,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,244 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 09:35:46,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 09:35:46,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 09:35:46,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 09:35:46,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 09:35:46,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (1/1) ... [2024-11-07 09:35:46,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 09:35:46,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 09:35:46,312 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 09:35:46,317 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 09:35:46,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 09:35:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 09:35:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 09:35:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 09:35:46,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 09:35:46,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 09:35:46,414 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 09:35:46,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 09:35:47,312 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 09:35:47,312 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 09:35:47,320 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 09:35:47,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 09:35:47,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:35:47 BoogieIcfgContainer [2024-11-07 09:35:47,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 09:35:47,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 09:35:47,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 09:35:47,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 09:35:47,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:35:45" (1/3) ... [2024-11-07 09:35:47,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e6f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:35:47, skipping insertion in model container [2024-11-07 09:35:47,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:35:46" (2/3) ... [2024-11-07 09:35:47,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e6f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:35:47, skipping insertion in model container [2024-11-07 09:35:47,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:35:47" (3/3) ... [2024-11-07 09:35:47,332 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-84.i [2024-11-07 09:35:47,346 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 09:35:47,346 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 09:35:47,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 09:35:47,410 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;@1c061bb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 09:35:47,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 09:35:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:35:47,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 09:35:47,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:35:47,429 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:47,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:35:47,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:35:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1290669553, now seen corresponding path program 1 times [2024-11-07 09:35:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:35:47,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732692800] [2024-11-07 09:35:47,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:35:47,445 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 09:35:47,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:35:47,448 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 09:35:47,462 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 09:35:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:47,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 09:35:47,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:35:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-07 09:35:47,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:35:47,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:35:47,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732692800] [2024-11-07 09:35:47,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732692800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:35:47,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:35:47,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 09:35:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541431899] [2024-11-07 09:35:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:35:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 09:35:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:35:47,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 09:35:47,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 09:35:47,800 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 09:35:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:35:47,820 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2024-11-07 09:35:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 09:35:47,822 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 76 [2024-11-07 09:35:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:35:47,828 INFO L225 Difference]: With dead ends: 81 [2024-11-07 09:35:47,828 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 09:35:47,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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 09:35:47,834 INFO L432 NwaCegarLoop]: 55 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, 55 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 09:35:47,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 09:35:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 09:35:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-07 09:35:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:35:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-07 09:35:47,879 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 76 [2024-11-07 09:35:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:35:47,880 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-07 09:35:47,880 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-07 09:35:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-07 09:35:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 09:35:47,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:35:47,885 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:47,896 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 09:35:48,086 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 09:35:48,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:35:48,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:35:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash -311629705, now seen corresponding path program 1 times [2024-11-07 09:35:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:35:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435695940] [2024-11-07 09:35:48,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:35:48,089 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 09:35:48,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:35:48,092 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 09:35:48,094 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 09:35:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:48,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 09:35:48,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:35:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 09:35:48,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:35:48,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:35:48,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435695940] [2024-11-07 09:35:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435695940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:35:48,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:35:48,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 09:35:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658864809] [2024-11-07 09:35:48,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:35:48,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 09:35:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:35:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 09:35:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 09:35:48,400 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 09:35:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:35:48,529 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2024-11-07 09:35:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 09:35:48,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2024-11-07 09:35:48,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:35:48,540 INFO L225 Difference]: With dead ends: 77 [2024-11-07 09:35:48,540 INFO L226 Difference]: Without dead ends: 40 [2024-11-07 09:35:48,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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 09:35:48,541 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 09:35:48,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 09:35:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-07 09:35:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-07 09:35:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 09:35:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-07 09:35:48,553 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 76 [2024-11-07 09:35:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:35:48,554 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-07 09:35:48,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 09:35:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-07 09:35:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 09:35:48,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:35:48,555 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:48,563 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 09:35:48,757 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 [2024-11-07 09:35:48,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:35:48,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:35:48,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1463377657, now seen corresponding path program 1 times [2024-11-07 09:35:48,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:35:48,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371931989] [2024-11-07 09:35:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:35:48,758 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 09:35:48,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:35:48,763 INFO L229 MonitoredProcess]: Starting monitored process 4 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 09:35:48,764 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 (4)] Waiting until timeout for monitored process [2024-11-07 09:35:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:35:48,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 09:35:48,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 09:36:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 09:36:58,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 09:36:58,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 09:36:58,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371931989] [2024-11-07 09:36:58,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371931989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 09:36:58,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 09:36:58,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 09:36:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644581837] [2024-11-07 09:36:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 09:36:58,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 09:36:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 09:36:58,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 09:36:58,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 09:36:58,659 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 09:37:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 09:37:08,985 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-11-07 09:37:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 09:37:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 76 [2024-11-07 09:37:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 09:37:08,987 INFO L225 Difference]: With dead ends: 69 [2024-11-07 09:37:08,987 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 09:37:08,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 09:37:08,988 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 31 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-07 09:37:08,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 290 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-07 09:37:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 09:37:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2024-11-07 09:37:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 09:37:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2024-11-07 09:37:08,998 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 76 [2024-11-07 09:37:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 09:37:08,998 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2024-11-07 09:37:08,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-07 09:37:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2024-11-07 09:37:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-07 09:37:09,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 09:37:09,000 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:09,008 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 (4)] Ended with exit code 0 [2024-11-07 09:37:09,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 09:37:09,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 09:37:09,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 09:37:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2143436027, now seen corresponding path program 1 times [2024-11-07 09:37:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 09:37:09,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210280751] [2024-11-07 09:37:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 09:37:09,202 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 09:37:09,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 09:37:09,205 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 09:37:09,207 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 09:37:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 09:37:09,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 09:37:09,403 INFO L278 TraceCheckSpWp]: Computing forward predicates...