./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_loopvsstraightlinecode_50-while_file-1.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 91dcb1d48bb0eca7aa2ec33a21dcdd775aa1755cb1856f7606102fe5579d2f23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:49:49,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:49:49,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:49:49,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:49:49,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:49:49,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:49:49,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:49:49,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:49:49,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:49:49,185 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:49:49,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:49:49,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:49:49,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:49:49,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:49:49,185 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:49:49,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:49:49,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:49:49,186 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:49:49,187 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:49:49,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:49,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:49,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:49,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:49,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:49:49,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:49,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:49,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:49,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:49,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:49:49,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:49:49,188 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:49:49,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:49:49,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:49:49,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:49:49,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:49:49,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:49:49,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:49:49,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:49:49,189 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 -> 91dcb1d48bb0eca7aa2ec33a21dcdd775aa1755cb1856f7606102fe5579d2f23 [2025-01-09 13:49:49,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:49:49,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:49:49,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:49:49,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:49:49,452 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:49:49,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-1.i [2025-01-09 13:49:50,661 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12a3ff3e2/e707b75795094f19b6f8dd3d2b80f6b5/FLAG88b81c8f4 [2025-01-09 13:49:50,992 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:49:50,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-1.i [2025-01-09 13:49:51,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12a3ff3e2/e707b75795094f19b6f8dd3d2b80f6b5/FLAG88b81c8f4 [2025-01-09 13:49:51,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12a3ff3e2/e707b75795094f19b6f8dd3d2b80f6b5 [2025-01-09 13:49:51,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:49:51,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:49:51,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:51,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:49:51,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:49:51,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a12e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51, skipping insertion in model container [2025-01-09 13:49:51,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:49:51,146 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_loopvsstraightlinecode_50-while_file-1.i[914,927] [2025-01-09 13:49:51,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:51,206 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:49:51,217 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_loopvsstraightlinecode_50-while_file-1.i[914,927] [2025-01-09 13:49:51,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:51,258 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:49:51,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51 WrapperNode [2025-01-09 13:49:51,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:51,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:51,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:49:51,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:49:51,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,301 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-01-09 13:49:51,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:51,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:49:51,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:49:51,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:49:51,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,320 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]. [2025-01-09 13:49:51,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:49:51,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:49:51,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:49:51,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:49:51,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (1/1) ... [2025-01-09 13:49:51,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:51,366 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) [2025-01-09 13:49:51,371 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 [2025-01-09 13:49:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:49:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:49:51,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:49:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:49:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:49:51,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:49:51,440 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:49:51,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:49:51,648 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 13:49:51,649 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:49:51,657 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:49:51,659 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:49:51,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:51 BoogieIcfgContainer [2025-01-09 13:49:51,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:49:51,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:49:51,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:49:51,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:49:51,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:49:51" (1/3) ... [2025-01-09 13:49:51,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787e97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:51, skipping insertion in model container [2025-01-09 13:49:51,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:51" (2/3) ... [2025-01-09 13:49:51,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787e97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:51, skipping insertion in model container [2025-01-09 13:49:51,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:51" (3/3) ... [2025-01-09 13:49:51,669 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-1.i [2025-01-09 13:49:51,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:49:51,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-1.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:49:51,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:49:51,734 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;@6b5a60e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:49:51,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:49:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 13:49:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 13:49:51,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:51,745 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:51,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:51,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1457883273, now seen corresponding path program 1 times [2025-01-09 13:49:51,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:51,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222041415] [2025-01-09 13:49:51,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:51,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:51,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 13:49:51,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 13:49:51,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:51,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 13:49:52,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:49:52,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222041415] [2025-01-09 13:49:52,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222041415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:49:52,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277066544] [2025-01-09 13:49:52,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:52,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:52,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:52,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:49:52,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:49:52,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 13:49:52,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 13:49:52,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:52,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:52,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:49:52,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 13:49:52,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:49:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277066544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:52,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:49:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:49:52,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412948979] [2025-01-09 13:49:52,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:52,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:49:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:49:52,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:49:52,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:49:52,238 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 13:49:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:52,255 INFO L93 Difference]: Finished difference Result 128 states and 220 transitions. [2025-01-09 13:49:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:49:52,257 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2025-01-09 13:49:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:52,262 INFO L225 Difference]: With dead ends: 128 [2025-01-09 13:49:52,262 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 13:49:52,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:49:52,272 INFO L435 NwaCegarLoop]: 95 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, 95 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 [2025-01-09 13:49:52,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:49:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 13:49:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-09 13:49:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 13:49:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2025-01-09 13:49:52,301 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 146 [2025-01-09 13:49:52,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:52,302 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2025-01-09 13:49:52,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 13:49:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2025-01-09 13:49:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 13:49:52,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:52,306 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:52,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:49:52,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:49:52,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:52,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1565713271, now seen corresponding path program 1 times [2025-01-09 13:49:52,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:52,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825692261] [2025-01-09 13:49:52,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:52,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 13:49:52,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 13:49:52,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:52,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 13:49:52,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:49:52,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825692261] [2025-01-09 13:49:52,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825692261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:52,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:49:52,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:49:52,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947136283] [2025-01-09 13:49:52,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:52,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:49:52,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:49:52,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:49:52,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:49:52,884 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:49:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:52,910 INFO L93 Difference]: Finished difference Result 186 states and 279 transitions. [2025-01-09 13:49:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:49:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 146 [2025-01-09 13:49:52,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:52,913 INFO L225 Difference]: With dead ends: 186 [2025-01-09 13:49:52,915 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 13:49:52,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:49:52,916 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:52,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:49:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 13:49:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2025-01-09 13:49:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 13:49:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2025-01-09 13:49:52,946 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 146 [2025-01-09 13:49:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:52,949 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2025-01-09 13:49:52,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:49:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2025-01-09 13:49:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:49:52,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:52,950 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:52,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:49:52,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:52,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2043597864, now seen corresponding path program 1 times [2025-01-09 13:49:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:52,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929483887] [2025-01-09 13:49:52,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:52,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:49:53,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:49:53,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:53,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 13:49:53,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:49:53,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929483887] [2025-01-09 13:49:53,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929483887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:53,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:49:53,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:49:53,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142703516] [2025-01-09 13:49:53,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:53,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:49:53,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:49:53,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:49:53,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:49:53,362 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 13:49:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:53,717 INFO L93 Difference]: Finished difference Result 395 states and 578 transitions. [2025-01-09 13:49:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:49:53,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2025-01-09 13:49:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:53,720 INFO L225 Difference]: With dead ends: 395 [2025-01-09 13:49:53,720 INFO L226 Difference]: Without dead ends: 334 [2025-01-09 13:49:53,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:49:53,721 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 390 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:53,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 221 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:49:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-01-09 13:49:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 175. [2025-01-09 13:49:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 112 states have internal predecessors, (140), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 13:49:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2025-01-09 13:49:53,752 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 147 [2025-01-09 13:49:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:53,753 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2025-01-09 13:49:53,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 13:49:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2025-01-09 13:49:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:49:53,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:53,754 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:53,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:49:53,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:53,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1345972951, now seen corresponding path program 1 times [2025-01-09 13:49:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044646829] [2025-01-09 13:49:53,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:53,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:49:53,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:49:53,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:53,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 13:49:53,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:49:53,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044646829] [2025-01-09 13:49:53,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044646829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:53,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:49:53,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:49:53,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761279850] [2025-01-09 13:49:53,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:53,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:49:53,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:49:53,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:49:53,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:49:53,907 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:49:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:54,036 INFO L93 Difference]: Finished difference Result 441 states and 646 transitions. [2025-01-09 13:49:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:49:54,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2025-01-09 13:49:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:54,040 INFO L225 Difference]: With dead ends: 441 [2025-01-09 13:49:54,041 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 13:49:54,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:49:54,044 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 83 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:54,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 327 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:49:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 13:49:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 231. [2025-01-09 13:49:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 142 states have (on average 1.2112676056338028) internal successors, (172), 144 states have internal predecessors, (172), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 13:49:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 336 transitions. [2025-01-09 13:49:54,089 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 336 transitions. Word has length 147 [2025-01-09 13:49:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:54,090 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 336 transitions. [2025-01-09 13:49:54,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:49:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 336 transitions. [2025-01-09 13:49:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:49:54,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:54,094 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:54,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:49:54,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:54,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:54,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1342533286, now seen corresponding path program 1 times [2025-01-09 13:49:54,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422672580] [2025-01-09 13:49:54,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:54,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:49:54,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:49:54,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:54,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 13:49:54,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:49:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422672580] [2025-01-09 13:49:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422672580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:49:54,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:49:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429563874] [2025-01-09 13:49:54,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:54,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:49:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:49:54,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:49:54,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:49:54,294 INFO L87 Difference]: Start difference. First operand 231 states and 336 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 13:49:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:54,549 INFO L93 Difference]: Finished difference Result 395 states and 569 transitions. [2025-01-09 13:49:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:49:54,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2025-01-09 13:49:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:54,552 INFO L225 Difference]: With dead ends: 395 [2025-01-09 13:49:54,552 INFO L226 Difference]: Without dead ends: 319 [2025-01-09 13:49:54,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:49:54,553 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 200 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:54,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 209 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:49:54,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-01-09 13:49:54,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 231. [2025-01-09 13:49:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 142 states have (on average 1.204225352112676) internal successors, (171), 144 states have internal predecessors, (171), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 13:49:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 335 transitions. [2025-01-09 13:49:54,581 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 335 transitions. Word has length 147 [2025-01-09 13:49:54,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:54,582 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 335 transitions. [2025-01-09 13:49:54,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 13:49:54,582 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 335 transitions. [2025-01-09 13:49:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:49:54,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:54,583 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:54,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:49:54,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:54,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2047037529, now seen corresponding path program 1 times [2025-01-09 13:49:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:49:54,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408999913] [2025-01-09 13:49:54,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:54,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:49:54,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:49:54,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:49:54,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:54,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:49:54,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818501450] [2025-01-09 13:49:54,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:54,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:54,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:54,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:49:54,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:49:54,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:49:54,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:49:54,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:54,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:49:54,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:49:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:49:54,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:49:54,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:54,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:49:54,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:49:54,874 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:49:54,875 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:49:54,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:49:55,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:49:55,080 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 13:49:55,150 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:49:55,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:49:55 BoogieIcfgContainer [2025-01-09 13:49:55,152 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:49:55,153 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:49:55,153 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:49:55,153 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:49:55,154 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:51" (3/4) ... [2025-01-09 13:49:55,155 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:49:55,156 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:49:55,156 INFO L158 Benchmark]: Toolchain (without parser) took 4134.89ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 141.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2025-01-09 13:49:55,156 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:55,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.89ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 145.2MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:49:55,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.51ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 142.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:55,157 INFO L158 Benchmark]: Boogie Preprocessor took 30.91ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 138.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:55,157 INFO L158 Benchmark]: RCFGBuilder took 326.58ms. Allocated memory is still 201.3MB. Free memory was 138.7MB in the beginning and 118.4MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 13:49:55,157 INFO L158 Benchmark]: TraceAbstraction took 3490.76ms. Allocated memory is still 201.3MB. Free memory was 117.8MB in the beginning and 141.5MB in the end (delta: -23.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:55,157 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 201.3MB. Free memory was 141.5MB in the beginning and 141.4MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:49:55,158 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.89ms. Allocated memory is still 201.3MB. Free memory was 159.4MB in the beginning and 145.2MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.51ms. Allocated memory is still 201.3MB. Free memory was 145.2MB in the beginning and 142.4MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.91ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 138.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 326.58ms. Allocated memory is still 201.3MB. Free memory was 138.7MB in the beginning and 118.4MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3490.76ms. Allocated memory is still 201.3MB. Free memory was 117.8MB in the beginning and 141.5MB in the end (delta: -23.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 201.3MB. Free memory was 141.5MB in the beginning and 141.4MB in the end (delta: 39.1kB). 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 102, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2, var_1_9=4000000001/4] [L138] isInitial = 1 [L139] FCALL initially() [L141] FCALL updateLastVariables() [L142] CALL updateVariables() [L94] var_1_9 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L95] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L96] var_1_11 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L97] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L98] var_1_13 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L99] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L100] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L100] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L101] var_1_14 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L102] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L103] var_1_16 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L104] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L105] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L105] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L106] var_1_17 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L107] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L108] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L108] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L109] var_1_19 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L110] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L111] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L111] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L112] var_1_20 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L114] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L114] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L115] var_1_21 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L116] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L117] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L117] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L118] var_1_22 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L119] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L120] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L120] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L121] var_1_24 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L122] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L123] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L123] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L124] var_1_25 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L125] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L126] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L126] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L127] var_1_26 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L128] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L129] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L129] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L142] RET updateVariables() [L143] CALL step() [L46] var_1_15 = (var_1_16 - var_1_17) [L47] var_1_27 = var_1_21 [L48] unsigned char stepLocal_1 = var_1_27; [L49] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L50] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L51] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L59] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L62] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L63] COND FALSE !(var_1_27 > stepLocal_2) [L66] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L68] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L69] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L71] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L72] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L81] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L82] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L83] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L86] COND TRUE 1 >= stepLocal_3 [L87] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L143] RET step() [L144] CALL, EXPR property() [L134-L135] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=62, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 716 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 716 mSDsluCounter, 1038 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 456 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 478 IncrementalHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 582 mSDtfsCounter, 478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 309 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 873 ConstructedInterpolants, 0 QuantifiedInterpolants, 1589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 6028/6072 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 13:49:55,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_loopvsstraightlinecode_50-while_file-1.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 91dcb1d48bb0eca7aa2ec33a21dcdd775aa1755cb1856f7606102fe5579d2f23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:49:57,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:49:57,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:49:57,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:49:57,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:49:57,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:49:57,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:49:57,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:49:57,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:49:57,376 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:49:57,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:49:57,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:49:57,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:49:57,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:49:57,377 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:49:57,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:49:57,378 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:49:57,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:49:57,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:49:57,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:49:57,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:49:57,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:49:57,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:57,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:57,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:57,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:57,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:49:57,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:57,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:57,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:57,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:57,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:49:57,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:49:57,380 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:49:57,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:49:57,381 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:49:57,381 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:49:57,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:49:57,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:49:57,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:49:57,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:49:57,381 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 -> 91dcb1d48bb0eca7aa2ec33a21dcdd775aa1755cb1856f7606102fe5579d2f23 [2025-01-09 13:49:57,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:49:57,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:49:57,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:49:57,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:49:57,613 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:49:57,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-1.i [2025-01-09 13:49:58,842 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f72ae0dca/f0a12724a67841db80f5626e2461933c/FLAG2aa81300d [2025-01-09 13:49:59,102 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:49:59,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-1.i [2025-01-09 13:49:59,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f72ae0dca/f0a12724a67841db80f5626e2461933c/FLAG2aa81300d [2025-01-09 13:49:59,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f72ae0dca/f0a12724a67841db80f5626e2461933c [2025-01-09 13:49:59,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:49:59,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:49:59,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:59,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:49:59,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:49:59,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a437223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59, skipping insertion in model container [2025-01-09 13:49:59,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:49:59,248 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_loopvsstraightlinecode_50-while_file-1.i[914,927] [2025-01-09 13:49:59,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:59,310 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:49:59,318 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_loopvsstraightlinecode_50-while_file-1.i[914,927] [2025-01-09 13:49:59,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:49:59,368 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:49:59,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59 WrapperNode [2025-01-09 13:49:59,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:59,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:59,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:49:59,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:49:59,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,409 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-01-09 13:49:59,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:49:59,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:49:59,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:49:59,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:49:59,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,436 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]. [2025-01-09 13:49:59,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:49:59,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:49:59,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:49:59,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:49:59,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:59,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:49:59,484 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) [2025-01-09 13:49:59,490 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 [2025-01-09 13:49:59,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:49:59,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:49:59,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:49:59,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:49:59,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:49:59,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:49:59,577 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:49:59,582 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:49:59,845 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 13:49:59,845 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:49:59,852 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:49:59,852 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:49:59,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:59 BoogieIcfgContainer [2025-01-09 13:49:59,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:49:59,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:49:59,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:49:59,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:49:59,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:49:59" (1/3) ... [2025-01-09 13:49:59,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f6c619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:59, skipping insertion in model container [2025-01-09 13:49:59,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59" (2/3) ... [2025-01-09 13:49:59,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f6c619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:49:59, skipping insertion in model container [2025-01-09 13:49:59,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:49:59" (3/3) ... [2025-01-09 13:49:59,879 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-1.i [2025-01-09 13:49:59,895 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:49:59,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-1.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:49:59,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:49:59,959 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;@5ace81f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:49:59,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:49:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 13:49:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 13:49:59,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:59,972 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:49:59,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:59,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1457883273, now seen corresponding path program 1 times [2025-01-09 13:49:59,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:49:59,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062613364] [2025-01-09 13:49:59,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:59,990 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 [2025-01-09 13:49:59,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:49:59,992 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) [2025-01-09 13:49:59,998 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 [2025-01-09 13:50:00,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 13:50:00,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 13:50:00,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:00,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:00,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:50:00,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:50:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-01-09 13:50:00,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:50:00,294 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:50:00,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062613364] [2025-01-09 13:50:00,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062613364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:50:00,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:50:00,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:50:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759048669] [2025-01-09 13:50:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:50:00,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:50:00,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:50:00,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:50:00,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:50:00,315 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 13:50:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:50:00,338 INFO L93 Difference]: Finished difference Result 128 states and 220 transitions. [2025-01-09 13:50:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:50:00,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2025-01-09 13:50:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:50:00,347 INFO L225 Difference]: With dead ends: 128 [2025-01-09 13:50:00,347 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 13:50:00,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:50:00,352 INFO L435 NwaCegarLoop]: 95 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, 95 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 [2025-01-09 13:50:00,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:50:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 13:50:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-09 13:50:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 13:50:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2025-01-09 13:50:00,399 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 146 [2025-01-09 13:50:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:50:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2025-01-09 13:50:00,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 13:50:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2025-01-09 13:50:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 13:50:00,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:00,402 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:50:00,414 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 [2025-01-09 13:50:00,602 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 [2025-01-09 13:50:00,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:00,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1565713271, now seen corresponding path program 1 times [2025-01-09 13:50:00,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:50:00,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071508453] [2025-01-09 13:50:00,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:00,605 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 [2025-01-09 13:50:00,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:50:00,609 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) [2025-01-09 13:50:00,613 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 [2025-01-09 13:50:00,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 13:50:00,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 13:50:00,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:00,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:00,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 13:50:00,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:50:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 527 proven. 48 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-01-09 13:50:01,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:50:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 13:50:01,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:50:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071508453] [2025-01-09 13:50:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071508453] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 13:50:01,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:50:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-01-09 13:50:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300478908] [2025-01-09 13:50:01,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:50:01,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:50:01,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:50:01,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:50:01,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:50:01,314 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:50:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:50:01,353 INFO L93 Difference]: Finished difference Result 125 states and 187 transitions. [2025-01-09 13:50:01,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:50:01,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 146 [2025-01-09 13:50:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:50:01,355 INFO L225 Difference]: With dead ends: 125 [2025-01-09 13:50:01,355 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 13:50:01,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:50:01,356 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:50:01,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:50:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 13:50:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-01-09 13:50:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 13:50:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2025-01-09 13:50:01,370 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 146 [2025-01-09 13:50:01,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:50:01,371 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2025-01-09 13:50:01,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:50:01,371 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2025-01-09 13:50:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 13:50:01,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:01,377 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:50:01,387 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 13:50:01,577 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 [2025-01-09 13:50:01,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:01,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1172686261, now seen corresponding path program 1 times [2025-01-09 13:50:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:50:01,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876811502] [2025-01-09 13:50:01,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:01,584 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 [2025-01-09 13:50:01,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:50:01,587 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) [2025-01-09 13:50:01,588 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 [2025-01-09 13:50:01,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 13:50:01,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 13:50:01,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:01,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:01,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 13:50:01,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:50:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 13:50:01,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:50:01,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:50:01,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876811502] [2025-01-09 13:50:01,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876811502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:50:01,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:50:01,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:50:01,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095169332] [2025-01-09 13:50:01,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:50:01,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:50:01,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:50:01,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:50:01,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:50:01,931 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:50:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:50:01,957 INFO L93 Difference]: Finished difference Result 186 states and 276 transitions. [2025-01-09 13:50:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:50:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 146 [2025-01-09 13:50:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:50:01,960 INFO L225 Difference]: With dead ends: 186 [2025-01-09 13:50:01,960 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 13:50:01,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:50:01,961 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:50:01,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:50:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 13:50:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2025-01-09 13:50:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 13:50:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2025-01-09 13:50:01,982 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 183 transitions. Word has length 146 [2025-01-09 13:50:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:50:01,982 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 183 transitions. [2025-01-09 13:50:01,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:50:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 183 transitions. [2025-01-09 13:50:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:50:01,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:01,984 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:50:01,992 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 13:50:02,184 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 [2025-01-09 13:50:02,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:02,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1342533286, now seen corresponding path program 1 times [2025-01-09 13:50:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:50:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239608602] [2025-01-09 13:50:02,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:02,187 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 [2025-01-09 13:50:02,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:50:02,192 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) [2025-01-09 13:50:02,193 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 [2025-01-09 13:50:02,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:50:02,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:50:02,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:02,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:02,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 13:50:02,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:50:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 516 proven. 27 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-01-09 13:50:02,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:50:02,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:50:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239608602] [2025-01-09 13:50:02,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239608602] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:50:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [691792737] [2025-01-09 13:50:02,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:02,564 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 13:50:02,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 13:50:02,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 13:50:02,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 13:50:02,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:50:03,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:50:03,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:03,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:03,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 13:50:03,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:50:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 13:50:03,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:50:03,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [691792737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:50:03,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:50:03,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-01-09 13:50:03,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052997012] [2025-01-09 13:50:03,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:50:03,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:50:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:50:03,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:50:03,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:50:03,262 INFO L87 Difference]: Start difference. First operand 123 states and 183 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:50:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:50:03,726 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2025-01-09 13:50:03,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:50:03,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2025-01-09 13:50:03,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:50:03,731 INFO L225 Difference]: With dead ends: 309 [2025-01-09 13:50:03,731 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 13:50:03,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:50:03,732 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 162 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:50:03,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 301 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:50:03,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 13:50:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 167. [2025-01-09 13:50:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 103 states have (on average 1.203883495145631) internal successors, (124), 104 states have internal predecessors, (124), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 13:50:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2025-01-09 13:50:03,808 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 147 [2025-01-09 13:50:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:50:03,809 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2025-01-09 13:50:03,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 13:50:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2025-01-09 13:50:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 13:50:03,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:03,811 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:50:03,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-01-09 13:50:04,017 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 13:50:04,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:50:04,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2047037529, now seen corresponding path program 1 times [2025-01-09 13:50:04,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:50:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351652912] [2025-01-09 13:50:04,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:04,216 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 [2025-01-09 13:50:04,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:50:04,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:50:04,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 13:50:04,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 13:50:04,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 13:50:04,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:04,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:04,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 13:50:04,371 INFO L279 TraceCheckSpWp]: Computing forward predicates...