./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.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_fillercode_fillercodestructure_filler-pe-ci_file-50.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 dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:28:11,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:28:11,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:28:11,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:28:11,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:28:11,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:28:11,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:28:11,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:28:11,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:28:11,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:28:11,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:28:11,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:28:11,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:28:11,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:28:11,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:28:11,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:28:11,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:28:11,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:28:11,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:28:11,472 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 -> dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 [2025-01-09 10:28:11,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:28:11,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:28:11,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:28:11,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:28:11,708 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:28:11,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-01-09 10:28:12,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8dcf68cd8/b799e3cc76574e97a550dfe2de014e8d/FLAGdc7a89e92 [2025-01-09 10:28:13,117 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:28:13,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-01-09 10:28:13,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8dcf68cd8/b799e3cc76574e97a550dfe2de014e8d/FLAGdc7a89e92 [2025-01-09 10:28:13,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8dcf68cd8/b799e3cc76574e97a550dfe2de014e8d [2025-01-09 10:28:13,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:28:13,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:28:13,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:28:13,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:28:13,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:28:13,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6896b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13, skipping insertion in model container [2025-01-09 10:28:13,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:28:13,282 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_fillercode_fillercodestructure_filler-pe-ci_file-50.i[919,932] [2025-01-09 10:28:13,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:28:13,376 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:28:13,385 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_fillercode_fillercodestructure_filler-pe-ci_file-50.i[919,932] [2025-01-09 10:28:13,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:28:13,429 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:28:13,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13 WrapperNode [2025-01-09 10:28:13,431 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:28:13,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:28:13,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:28:13,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:28:13,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,477 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2025-01-09 10:28:13,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:28:13,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:28:13,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:28:13,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:28:13,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,521 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 10:28:13,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:28:13,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:28:13,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:28:13,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:28:13,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (1/1) ... [2025-01-09 10:28:13,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:28:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:13,579 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 10:28:13,584 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 10:28:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:28:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:28:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:28:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:28:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:28:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:28:13,654 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:28:13,656 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:28:13,959 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 10:28:13,959 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:28:13,968 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:28:13,969 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:28:13,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:28:13 BoogieIcfgContainer [2025-01-09 10:28:13,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:28:13,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:28:13,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:28:13,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:28:13,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:28:13" (1/3) ... [2025-01-09 10:28:13,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153348c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:28:13, skipping insertion in model container [2025-01-09 10:28:13,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:13" (2/3) ... [2025-01-09 10:28:13,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153348c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:28:13, skipping insertion in model container [2025-01-09 10:28:13,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:28:13" (3/3) ... [2025-01-09 10:28:13,978 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-01-09 10:28:13,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:28:13,990 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:28:14,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:28:14,039 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;@582deca5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:28:14,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:28:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 10:28:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 10:28:14,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:14,053 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:14,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:14,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1780844987, now seen corresponding path program 1 times [2025-01-09 10:28:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:14,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144739744] [2025-01-09 10:28:14,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:14,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 10:28:14,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 10:28:14,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:14,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 10:28:14,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:14,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144739744] [2025-01-09 10:28:14,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144739744] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:28:14,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078888805] [2025-01-09 10:28:14,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:14,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:28:14,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:14,325 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 10:28:14,327 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 10:28:14,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 10:28:14,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 10:28:14,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:14,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:14,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:28:14,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:28:14,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 10:28:14,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:28:14,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078888805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:14,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:28:14,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:28:14,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757118168] [2025-01-09 10:28:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:14,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:28:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:14,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:28:14,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:28:14,527 INFO L87 Difference]: Start difference. First operand has 90 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 64 states have internal predecessors, (89), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:28:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:14,544 INFO L93 Difference]: Finished difference Result 174 states and 293 transitions. [2025-01-09 10:28:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:28:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2025-01-09 10:28:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:14,550 INFO L225 Difference]: With dead ends: 174 [2025-01-09 10:28:14,550 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 10:28:14,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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 10:28:14,554 INFO L435 NwaCegarLoop]: 131 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, 131 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 10:28:14,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:28:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 10:28:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-09 10:28:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 10:28:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 131 transitions. [2025-01-09 10:28:14,585 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 131 transitions. Word has length 165 [2025-01-09 10:28:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:14,585 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 131 transitions. [2025-01-09 10:28:14,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:28:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 131 transitions. [2025-01-09 10:28:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 10:28:14,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:14,590 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:14,596 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 10:28:14,791 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 10:28:14,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:14,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1019157887, now seen corresponding path program 1 times [2025-01-09 10:28:14,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:14,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838107249] [2025-01-09 10:28:14,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:14,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:14,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 10:28:14,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 10:28:14,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:14,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:14,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:14,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838107249] [2025-01-09 10:28:14,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838107249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:14,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:14,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:28:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098252315] [2025-01-09 10:28:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:14,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:28:14,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:14,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:28:14,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:28:14,997 INFO L87 Difference]: Start difference. First operand 87 states and 131 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:15,025 INFO L93 Difference]: Finished difference Result 172 states and 261 transitions. [2025-01-09 10:28:15,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:28:15,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-01-09 10:28:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:15,029 INFO L225 Difference]: With dead ends: 172 [2025-01-09 10:28:15,029 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 10:28:15,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 10:28:15,030 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:15,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:28:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 10:28:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 10:28:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 62 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 10:28:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2025-01-09 10:28:15,050 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 132 transitions. Word has length 165 [2025-01-09 10:28:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:15,053 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 132 transitions. [2025-01-09 10:28:15,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2025-01-09 10:28:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 10:28:15,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:15,057 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:15,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:28:15,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:15,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1295410284, now seen corresponding path program 1 times [2025-01-09 10:28:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706749189] [2025-01-09 10:28:15,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:15,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:15,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 10:28:15,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 10:28:15,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:15,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706749189] [2025-01-09 10:28:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706749189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:15,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:28:15,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959737024] [2025-01-09 10:28:15,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:15,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:28:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:15,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:28:15,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:28:15,277 INFO L87 Difference]: Start difference. First operand 88 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:15,471 INFO L93 Difference]: Finished difference Result 257 states and 388 transitions. [2025-01-09 10:28:15,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:28:15,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2025-01-09 10:28:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:15,474 INFO L225 Difference]: With dead ends: 257 [2025-01-09 10:28:15,475 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 10:28:15,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:28:15,475 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 124 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:15,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 311 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:28:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 10:28:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 92. [2025-01-09 10:28:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 10:28:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2025-01-09 10:28:15,494 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 166 [2025-01-09 10:28:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:15,495 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2025-01-09 10:28:15,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2025-01-09 10:28:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 10:28:15,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:15,498 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:15,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:28:15,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:15,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash -393533458, now seen corresponding path program 1 times [2025-01-09 10:28:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:15,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216484871] [2025-01-09 10:28:15,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:15,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:15,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 10:28:15,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 10:28:15,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:15,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216484871] [2025-01-09 10:28:16,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216484871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:16,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:16,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:28:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919271854] [2025-01-09 10:28:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:16,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:28:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:16,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:28:16,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:28:16,132 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:16,805 INFO L93 Difference]: Finished difference Result 407 states and 606 transitions. [2025-01-09 10:28:16,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 10:28:16,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2025-01-09 10:28:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:16,810 INFO L225 Difference]: With dead ends: 407 [2025-01-09 10:28:16,811 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 10:28:16,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:28:16,812 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 380 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:16,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 674 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:28:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 10:28:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 173. [2025-01-09 10:28:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 131 states have internal predecessors, (180), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 10:28:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2025-01-09 10:28:16,849 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 166 [2025-01-09 10:28:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:16,849 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2025-01-09 10:28:16,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2025-01-09 10:28:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 10:28:16,851 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:16,851 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:16,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:28:16,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:16,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash -510028050, now seen corresponding path program 1 times [2025-01-09 10:28:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:16,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229762055] [2025-01-09 10:28:16,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:16,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 10:28:16,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 10:28:16,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:16,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:17,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229762055] [2025-01-09 10:28:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229762055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:17,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:17,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:28:17,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141946843] [2025-01-09 10:28:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:17,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:28:17,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:17,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:28:17,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:28:17,017 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:17,136 INFO L93 Difference]: Finished difference Result 343 states and 517 transitions. [2025-01-09 10:28:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:28:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2025-01-09 10:28:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:17,141 INFO L225 Difference]: With dead ends: 343 [2025-01-09 10:28:17,141 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 10:28:17,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:28:17,143 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 124 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:17,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 193 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:28:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 10:28:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2025-01-09 10:28:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 126 states have (on average 1.373015873015873) internal successors, (173), 127 states have internal predecessors, (173), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 10:28:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 253 transitions. [2025-01-09 10:28:17,163 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 253 transitions. Word has length 166 [2025-01-09 10:28:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:17,164 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 253 transitions. [2025-01-09 10:28:17,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 253 transitions. [2025-01-09 10:28:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 10:28:17,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:17,165 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:17,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:28:17,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:17,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:17,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2095995504, now seen corresponding path program 1 times [2025-01-09 10:28:17,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:17,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638530166] [2025-01-09 10:28:17,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:17,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:17,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 10:28:17,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 10:28:17,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:17,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 10:28:17,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638530166] [2025-01-09 10:28:17,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638530166] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:28:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698279489] [2025-01-09 10:28:17,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:17,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:28:17,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:17,410 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 10:28:17,412 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 10:28:17,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 10:28:17,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 10:28:17,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:17,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:17,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:28:17,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:28:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 10:28:17,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:28:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 10:28:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698279489] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:28:18,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:28:18,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 10:28:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798133869] [2025-01-09 10:28:18,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:28:18,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:28:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:18,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:28:18,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:28:18,006 INFO L87 Difference]: Start difference. First operand 169 states and 253 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 10:28:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:18,168 INFO L93 Difference]: Finished difference Result 349 states and 515 transitions. [2025-01-09 10:28:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:28:18,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 166 [2025-01-09 10:28:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:18,169 INFO L225 Difference]: With dead ends: 349 [2025-01-09 10:28:18,170 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 10:28:18,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 329 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:28:18,170 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 97 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:18,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 253 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:28:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 10:28:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2025-01-09 10:28:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.3333333333333333) internal successors, (176), 133 states have internal predecessors, (176), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 10:28:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2025-01-09 10:28:18,189 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 166 [2025-01-09 10:28:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:18,190 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2025-01-09 10:28:18,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 10:28:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2025-01-09 10:28:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 10:28:18,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:18,191 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:18,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 10:28:18,395 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 10:28:18,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:18,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash 816131826, now seen corresponding path program 1 times [2025-01-09 10:28:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038561150] [2025-01-09 10:28:18,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:18,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:18,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 10:28:18,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 10:28:18,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:18,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 10:28:18,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:18,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038561150] [2025-01-09 10:28:18,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038561150] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:28:18,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869894044] [2025-01-09 10:28:18,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:18,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:28:18,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:18,677 INFO L229 MonitoredProcess]: Starting monitored process 4 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 10:28:18,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 10:28:18,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 10:28:18,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 10:28:18,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:18,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:18,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 10:28:18,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:28:19,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 615 proven. 51 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-01-09 10:28:19,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:28:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 81 proven. 54 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-01-09 10:28:19,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869894044] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:28:19,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:28:19,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 17 [2025-01-09 10:28:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587421168] [2025-01-09 10:28:19,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:28:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:28:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:19,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:28:19,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:28:19,500 INFO L87 Difference]: Start difference. First operand 177 states and 256 transitions. Second operand has 17 states, 16 states have (on average 7.0) internal successors, (112), 17 states have internal predecessors, (112), 5 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (52), 4 states have call predecessors, (52), 5 states have call successors, (52) [2025-01-09 10:28:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:20,927 INFO L93 Difference]: Finished difference Result 785 states and 1074 transitions. [2025-01-09 10:28:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 10:28:20,927 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.0) internal successors, (112), 17 states have internal predecessors, (112), 5 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (52), 4 states have call predecessors, (52), 5 states have call successors, (52) Word has length 166 [2025-01-09 10:28:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:20,930 INFO L225 Difference]: With dead ends: 785 [2025-01-09 10:28:20,930 INFO L226 Difference]: Without dead ends: 611 [2025-01-09 10:28:20,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1034, Invalid=3388, Unknown=0, NotChecked=0, Total=4422 [2025-01-09 10:28:20,933 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 768 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:20,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 424 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:28:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-01-09 10:28:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 242. [2025-01-09 10:28:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 197 states have (on average 1.284263959390863) internal successors, (253), 198 states have internal predecessors, (253), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 10:28:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 325 transitions. [2025-01-09 10:28:20,963 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 325 transitions. Word has length 166 [2025-01-09 10:28:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:20,973 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 325 transitions. [2025-01-09 10:28:20,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.0) internal successors, (112), 17 states have internal predecessors, (112), 5 states have call successors, (51), 3 states have call predecessors, (51), 7 states have return successors, (52), 4 states have call predecessors, (52), 5 states have call successors, (52) [2025-01-09 10:28:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 325 transitions. [2025-01-09 10:28:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 10:28:20,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:20,975 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:20,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 10:28:21,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:28:21,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:21,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:21,177 INFO L85 PathProgramCache]: Analyzing trace with hash 189891102, now seen corresponding path program 1 times [2025-01-09 10:28:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:21,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909354027] [2025-01-09 10:28:21,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:21,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:21,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 10:28:21,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 10:28:21,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:21,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:22,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:22,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909354027] [2025-01-09 10:28:22,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909354027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:22,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:22,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:28:22,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935758272] [2025-01-09 10:28:22,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:22,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:28:22,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:22,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:28:22,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:28:22,334 INFO L87 Difference]: Start difference. First operand 242 states and 325 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:28:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:24,949 INFO L93 Difference]: Finished difference Result 681 states and 899 transitions. [2025-01-09 10:28:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:28:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 167 [2025-01-09 10:28:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:24,953 INFO L225 Difference]: With dead ends: 681 [2025-01-09 10:28:24,955 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 10:28:24,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-01-09 10:28:24,956 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 590 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:24,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 724 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 10:28:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 10:28:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 260. [2025-01-09 10:28:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 214 states have (on average 1.280373831775701) internal successors, (274), 215 states have internal predecessors, (274), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 10:28:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 346 transitions. [2025-01-09 10:28:24,990 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 346 transitions. Word has length 167 [2025-01-09 10:28:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 346 transitions. [2025-01-09 10:28:24,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:28:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 346 transitions. [2025-01-09 10:28:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 10:28:24,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:24,993 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:24,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:28:24,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:24,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash 890955680, now seen corresponding path program 1 times [2025-01-09 10:28:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:24,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697570643] [2025-01-09 10:28:24,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:25,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 10:28:25,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 10:28:25,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:25,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 10:28:25,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:25,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697570643] [2025-01-09 10:28:25,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697570643] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:28:25,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795543160] [2025-01-09 10:28:25,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:25,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:28:25,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:25,418 INFO L229 MonitoredProcess]: Starting monitored process 5 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 10:28:25,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 10:28:25,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 10:28:25,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 10:28:25,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:25,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:25,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 10:28:25,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:28:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 694 proven. 129 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2025-01-09 10:28:26,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:28:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 93 proven. 105 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2025-01-09 10:28:26,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795543160] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:28:26,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:28:26,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 17] total 35 [2025-01-09 10:28:26,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723722610] [2025-01-09 10:28:26,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:28:26,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 10:28:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:26,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 10:28:26,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 10:28:26,968 INFO L87 Difference]: Start difference. First operand 260 states and 346 transitions. Second operand has 35 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 33 states have internal predecessors, (127), 9 states have call successors, (57), 4 states have call predecessors, (57), 9 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) [2025-01-09 10:28:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:29,245 INFO L93 Difference]: Finished difference Result 718 states and 931 transitions. [2025-01-09 10:28:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-09 10:28:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 33 states have internal predecessors, (127), 9 states have call successors, (57), 4 states have call predecessors, (57), 9 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) Word has length 167 [2025-01-09 10:28:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:29,251 INFO L225 Difference]: With dead ends: 718 [2025-01-09 10:28:29,251 INFO L226 Difference]: Without dead ends: 461 [2025-01-09 10:28:29,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1785, Invalid=5355, Unknown=0, NotChecked=0, Total=7140 [2025-01-09 10:28:29,255 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1165 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:29,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 745 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 10:28:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-01-09 10:28:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 312. [2025-01-09 10:28:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 255 states have (on average 1.2431372549019608) internal successors, (317), 257 states have internal predecessors, (317), 38 states have call successors, (38), 18 states have call predecessors, (38), 18 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 10:28:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 393 transitions. [2025-01-09 10:28:29,303 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 393 transitions. Word has length 167 [2025-01-09 10:28:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:29,303 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 393 transitions. [2025-01-09 10:28:29,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 3.8484848484848486) internal successors, (127), 33 states have internal predecessors, (127), 9 states have call successors, (57), 4 states have call predecessors, (57), 9 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) [2025-01-09 10:28:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 393 transitions. [2025-01-09 10:28:29,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 10:28:29,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:29,306 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:29,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 10:28:29,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 10:28:29,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:29,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:29,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1152201399, now seen corresponding path program 1 times [2025-01-09 10:28:29,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:29,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423064218] [2025-01-09 10:28:29,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:29,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:29,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 10:28:29,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 10:28:29,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:29,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 10:28:29,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423064218] [2025-01-09 10:28:29,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423064218] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:28:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652543373] [2025-01-09 10:28:29,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:29,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:28:29,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:29,851 INFO L229 MonitoredProcess]: Starting monitored process 6 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 10:28:29,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 10:28:29,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 10:28:30,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 10:28:30,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:30,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:30,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 10:28:30,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:28:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 509 proven. 126 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-01-09 10:28:30,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:28:36,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652543373] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:28:36,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:28:36,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 15 [2025-01-09 10:28:36,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459139671] [2025-01-09 10:28:36,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:28:36,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:28:36,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:36,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:28:36,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=295, Unknown=1, NotChecked=0, Total=380 [2025-01-09 10:28:36,519 INFO L87 Difference]: Start difference. First operand 312 states and 393 transitions. Second operand has 15 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 5 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2025-01-09 10:28:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:36,919 INFO L93 Difference]: Finished difference Result 564 states and 700 transitions. [2025-01-09 10:28:36,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:28:36,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 5 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) Word has length 168 [2025-01-09 10:28:36,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:36,923 INFO L225 Difference]: With dead ends: 564 [2025-01-09 10:28:36,923 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 10:28:36,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=162, Invalid=539, Unknown=1, NotChecked=0, Total=702 [2025-01-09 10:28:36,924 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 125 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:36,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 430 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:28:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 10:28:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2025-01-09 10:28:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 190 states have (on average 1.1736842105263159) internal successors, (223), 192 states have internal predecessors, (223), 38 states have call successors, (38), 18 states have call predecessors, (38), 18 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 10:28:36,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 299 transitions. [2025-01-09 10:28:36,958 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 299 transitions. Word has length 168 [2025-01-09 10:28:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:36,959 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 299 transitions. [2025-01-09 10:28:36,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 5 states have call successors, (41), 3 states have call predecessors, (41), 5 states have return successors, (41), 4 states have call predecessors, (41), 5 states have call successors, (41) [2025-01-09 10:28:36,959 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 299 transitions. [2025-01-09 10:28:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 10:28:36,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:36,960 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:36,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 10:28:37,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 10:28:37,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:37,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash 883450506, now seen corresponding path program 1 times [2025-01-09 10:28:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317089830] [2025-01-09 10:28:37,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:37,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 10:28:37,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 10:28:37,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:37,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:37,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:37,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317089830] [2025-01-09 10:28:37,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317089830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:37,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:37,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:28:37,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469506741] [2025-01-09 10:28:37,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:37,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:28:37,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:37,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:28:37,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:28:37,270 INFO L87 Difference]: Start difference. First operand 247 states and 299 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:37,331 INFO L93 Difference]: Finished difference Result 497 states and 604 transitions. [2025-01-09 10:28:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:28:37,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 169 [2025-01-09 10:28:37,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:37,333 INFO L225 Difference]: With dead ends: 497 [2025-01-09 10:28:37,333 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 10:28:37,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 10:28:37,334 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 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 10:28:37,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:28:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 10:28:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-01-09 10:28:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 196 states have (on average 1.1683673469387754) internal successors, (229), 198 states have internal predecessors, (229), 38 states have call successors, (38), 18 states have call predecessors, (38), 18 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 10:28:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2025-01-09 10:28:37,378 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 169 [2025-01-09 10:28:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:37,379 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2025-01-09 10:28:37,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2025-01-09 10:28:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 10:28:37,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:37,380 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:37,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:28:37,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:37,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1383448769, now seen corresponding path program 1 times [2025-01-09 10:28:37,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817246169] [2025-01-09 10:28:37,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:37,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 10:28:37,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 10:28:37,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:37,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:37,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817246169] [2025-01-09 10:28:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817246169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:37,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:28:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028472305] [2025-01-09 10:28:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:37,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:28:37,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:37,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:28:37,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:28:37,735 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:38,348 INFO L93 Difference]: Finished difference Result 731 states and 866 transitions. [2025-01-09 10:28:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:28:38,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 170 [2025-01-09 10:28:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:38,354 INFO L225 Difference]: With dead ends: 731 [2025-01-09 10:28:38,354 INFO L226 Difference]: Without dead ends: 481 [2025-01-09 10:28:38,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:28:38,355 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 368 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:38,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 619 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:28:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-01-09 10:28:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 268. [2025-01-09 10:28:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 211 states have (on average 1.180094786729858) internal successors, (249), 213 states have internal predecessors, (249), 38 states have call successors, (38), 18 states have call predecessors, (38), 18 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 10:28:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 325 transitions. [2025-01-09 10:28:38,398 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 325 transitions. Word has length 170 [2025-01-09 10:28:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:38,399 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 325 transitions. [2025-01-09 10:28:38,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 325 transitions. [2025-01-09 10:28:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 10:28:38,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:38,400 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:38,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:28:38,401 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash 869056383, now seen corresponding path program 1 times [2025-01-09 10:28:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:38,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497850058] [2025-01-09 10:28:38,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:38,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:38,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 10:28:38,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 10:28:38,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:38,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:38,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:38,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497850058] [2025-01-09 10:28:38,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497850058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:38,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:38,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:28:38,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926747883] [2025-01-09 10:28:38,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:38,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:28:38,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:38,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:28:38,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:28:38,530 INFO L87 Difference]: Start difference. First operand 268 states and 325 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:38,615 INFO L93 Difference]: Finished difference Result 581 states and 703 transitions. [2025-01-09 10:28:38,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:28:38,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 170 [2025-01-09 10:28:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:38,617 INFO L225 Difference]: With dead ends: 581 [2025-01-09 10:28:38,617 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 10:28:38,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:28:38,618 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 167 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:38,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 509 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:28:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 10:28:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 265. [2025-01-09 10:28:38,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 200 states have (on average 1.145) internal successors, (229), 201 states have internal predecessors, (229), 44 states have call successors, (44), 20 states have call predecessors, (44), 20 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 10:28:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 317 transitions. [2025-01-09 10:28:38,659 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 317 transitions. Word has length 170 [2025-01-09 10:28:38,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:38,660 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 317 transitions. [2025-01-09 10:28:38,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 317 transitions. [2025-01-09 10:28:38,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 10:28:38,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:38,661 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:38,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:28:38,661 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1502682879, now seen corresponding path program 1 times [2025-01-09 10:28:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925884758] [2025-01-09 10:28:38,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:38,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:38,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 10:28:38,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 10:28:38,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:38,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:44,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:44,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925884758] [2025-01-09 10:28:44,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925884758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:44,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:44,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 10:28:44,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237525691] [2025-01-09 10:28:44,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:44,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 10:28:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:44,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 10:28:44,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:28:44,072 INFO L87 Difference]: Start difference. First operand 265 states and 317 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:28:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:47,827 INFO L93 Difference]: Finished difference Result 727 states and 865 transitions. [2025-01-09 10:28:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 10:28:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 170 [2025-01-09 10:28:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:47,830 INFO L225 Difference]: With dead ends: 727 [2025-01-09 10:28:47,830 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 10:28:47,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=309, Invalid=813, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 10:28:47,832 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 221 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:47,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 984 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:28:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 10:28:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2025-01-09 10:28:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 330 states have (on average 1.1151515151515152) internal successors, (368), 332 states have internal predecessors, (368), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 10:28:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 544 transitions. [2025-01-09 10:28:47,928 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 544 transitions. Word has length 170 [2025-01-09 10:28:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:47,929 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 544 transitions. [2025-01-09 10:28:47,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 10:28:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 544 transitions. [2025-01-09 10:28:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 10:28:47,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:47,930 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:47,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:28:47,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1210556723, now seen corresponding path program 1 times [2025-01-09 10:28:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878983259] [2025-01-09 10:28:47,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:47,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 10:28:47,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 10:28:47,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:47,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:28:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:28:48,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:28:48,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878983259] [2025-01-09 10:28:48,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878983259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:28:48,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:28:48,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 10:28:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885175836] [2025-01-09 10:28:48,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:28:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:28:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:28:48,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:28:48,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:28:48,234 INFO L87 Difference]: Start difference. First operand 459 states and 544 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:28:48,895 INFO L93 Difference]: Finished difference Result 926 states and 1087 transitions. [2025-01-09 10:28:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:28:48,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 171 [2025-01-09 10:28:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:28:48,899 INFO L225 Difference]: With dead ends: 926 [2025-01-09 10:28:48,899 INFO L226 Difference]: Without dead ends: 664 [2025-01-09 10:28:48,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:28:48,900 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 314 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:28:48,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 502 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:28:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-01-09 10:28:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 469. [2025-01-09 10:28:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 342 states have (on average 1.1111111111111112) internal successors, (380), 344 states have internal predecessors, (380), 84 states have call successors, (84), 42 states have call predecessors, (84), 42 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 10:28:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 548 transitions. [2025-01-09 10:28:49,003 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 548 transitions. Word has length 171 [2025-01-09 10:28:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:28:49,003 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 548 transitions. [2025-01-09 10:28:49,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:28:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 548 transitions. [2025-01-09 10:28:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 10:28:49,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:28:49,005 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:28:49,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:28:49,005 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:28:49,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:28:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1605792979, now seen corresponding path program 1 times [2025-01-09 10:28:49,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:28:49,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752772336] [2025-01-09 10:28:49,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:49,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:28:49,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 10:28:49,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 10:28:49,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:49,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:28:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350301984] [2025-01-09 10:28:49,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:28:49,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:28:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:49,063 INFO L229 MonitoredProcess]: Starting monitored process 7 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 10:28:49,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 10:28:49,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 10:28:49,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 10:28:49,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:49,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:28:49,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 10:28:49,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 10:28:49,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 10:28:49,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:28:49,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:28:49,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 10:28:49,461 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 10:28:49,462 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 10:28:49,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 10:28:49,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 10:28:49,669 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:28:49,751 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 10:28:49,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:28:49 BoogieIcfgContainer [2025-01-09 10:28:49,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 10:28:49,754 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 10:28:49,754 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 10:28:49,754 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 10:28:49,755 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:28:13" (3/4) ... [2025-01-09 10:28:49,756 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 10:28:49,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 10:28:49,758 INFO L158 Benchmark]: Toolchain (without parser) took 36613.21ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 112.0MB in the beginning and 321.0MB in the end (delta: -209.0MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. [2025-01-09 10:28:49,758 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:28:49,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.39ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 10:28:49,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.60ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 91.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:28:49,758 INFO L158 Benchmark]: Boogie Preprocessor took 68.87ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 84.1MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 10:28:49,758 INFO L158 Benchmark]: RCFGBuilder took 422.08ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 56.9MB in the end (delta: 27.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 10:28:49,758 INFO L158 Benchmark]: TraceAbstraction took 35781.61ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 56.4MB in the beginning and 321.1MB in the end (delta: -264.7MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2025-01-09 10:28:49,758 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 486.5MB. Free memory was 321.1MB in the beginning and 321.0MB in the end (delta: 99.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:28:49,759 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.69ms. Allocated memory is still 201.3MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.39ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 96.1MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.60ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 91.6MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.87ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 84.1MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 422.08ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 56.9MB in the end (delta: 27.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35781.61ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 56.4MB in the beginning and 321.1MB in the end (delta: -264.7MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 486.5MB. Free memory was 321.1MB in the beginning and 321.0MB in the end (delta: 99.2kB). 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 57, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of bitwiseAnd at line 100, overapproximation of bitwiseAnd at line 117, overapproximation of someUnaryDOUBLEoperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryArithmeticFLOAToperation at line 57, overapproximation of someUnaryFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; VAL [isInitial=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=0, var_1_8=1, var_1_9=-2] [L173] isInitial = 1 [L174] FCALL initially() [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] COND TRUE \read(var_1_8) [L57] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L59] COND TRUE \read(var_1_8) [L60] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L62] var_1_29 = var_1_27 [L63] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L64] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L67] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L69] var_1_17 = ((var_1_18 - 25) - var_1_25) [L70] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16357, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L71] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L72] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L76] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L77] COND FALSE !((~ var_1_29) > stepLocal_3) [L80] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L82] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L83] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=127, stepLocal_1=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L84] COND FALSE !(stepLocal_1 <= (var_1_25 - var_1_25)) [L93] var_1_1 = 0 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L95] var_1_31 = var_1_26 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L96] COND FALSE !(! var_1_7) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L99] var_1_38 = ((((var_1_27) > (var_1_27)) ? (var_1_27) : (var_1_27))) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_38=127, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L100] EXPR var_1_18 & (var_1_29 + 2u) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_38=127, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L100] EXPR 16u >> var_1_26 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_38=127, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L100] COND TRUE (var_1_18 & (var_1_29 + 2u)) < (16u >> var_1_26) [L101] var_1_39 = ((var_1_7 && (var_1_7 && var_1_8)) && (! var_1_23)) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_38=127, var_1_39=1, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L103] COND FALSE !(var_1_36 <= var_1_16) [L108] var_1_44 = var_1_36 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_36=3, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L110] COND FALSE !((var_1_14 * (var_1_46 - var_1_47)) < var_1_14) [L115] var_1_45 = (((((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L117] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L117] EXPR var_1_18 & var_1_27 VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L117] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, stepLocal_0=127, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L117] COND FALSE !(var_1_20 || (var_1_26 >= (var_1_18 & var_1_27))) [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_16=0, var_1_17=16230, var_1_18=16382, var_1_1=0, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=127, var_1_26=256, var_1_27=-385, var_1_28=1, var_1_29=127, var_1_30=1, var_1_31=256, var_1_33=253/8, var_1_36=3, var_1_37=0, var_1_38=127, var_1_39=1, var_1_44=3, var_1_45=4, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.7s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4450 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4443 mSDsluCounter, 7102 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4974 mSDsCounter, 1464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5390 IncrementalHoareTripleChecker+Invalid, 6854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1464 mSolverCounterUnsat, 2128 mSDtfsCounter, 5390 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1646 GetRequests, 1372 SyntacticMatches, 3 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3648 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=469occurred in iteration=15, InterpolantAutomatonStates: 216, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1408 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 3686 NumberOfCodeBlocks, 3686 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3820 ConstructedInterpolants, 0 QuantifiedInterpolants, 17351 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1974 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 24530/25392 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 10:28:49,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.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 dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:28:51,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:28:51,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 10:28:51,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:28:51,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:28:51,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:28:51,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:28:51,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:28:51,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:28:51,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:28:51,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:28:51,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:28:51,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:28:51,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:28:51,823 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:28:51,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:28:51,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:28:51,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:28:51,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:28:51,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:28:51,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:28:51,825 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:28:51,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:28:51,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:28:51,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:28:51,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:28:51,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:28:51,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:28:51,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:28:51,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:28:51,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:28:51,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:28:51,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:28:51,826 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:28:51,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:28:51,827 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 10:28:51,827 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 10:28:51,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:28:51,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:28:51,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:28:51,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:28:51,827 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 -> dc7b01a2a7c989275ee332c4df25904527cd5d9a922607559c6a4e85b8c49683 [2025-01-09 10:28:52,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:28:52,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:28:52,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:28:52,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:28:52,114 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:28:52,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-01-09 10:28:53,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c753f6ac/823fa44a8f1b458e8ab6ef28ad0de6c5/FLAGa84d25d51 [2025-01-09 10:28:53,493 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:28:53,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-01-09 10:28:53,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c753f6ac/823fa44a8f1b458e8ab6ef28ad0de6c5/FLAGa84d25d51 [2025-01-09 10:28:53,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c753f6ac/823fa44a8f1b458e8ab6ef28ad0de6c5 [2025-01-09 10:28:53,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:28:53,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:28:53,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:28:53,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:28:53,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:28:53,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:28:53" (1/1) ... [2025-01-09 10:28:53,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e23ea20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:53, skipping insertion in model container [2025-01-09 10:28:53,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:28:53" (1/1) ... [2025-01-09 10:28:53,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:28:53,988 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_fillercode_fillercodestructure_filler-pe-ci_file-50.i[919,932] [2025-01-09 10:28:54,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:28:54,045 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:28:54,053 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_fillercode_fillercodestructure_filler-pe-ci_file-50.i[919,932] [2025-01-09 10:28:54,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:28:54,089 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:28:54,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54 WrapperNode [2025-01-09 10:28:54,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:28:54,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:28:54,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:28:54,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:28:54,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,130 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-01-09 10:28:54,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:28:54,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:28:54,135 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:28:54,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:28:54,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,173 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 10:28:54,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:28:54,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:28:54,193 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:28:54,193 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:28:54,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (1/1) ... [2025-01-09 10:28:54,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:28:54,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:28:54,224 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 10:28:54,226 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 10:28:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:28:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 10:28:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:28:54,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:28:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:28:54,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:28:54,329 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:28:54,331 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:29:02,979 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 10:29:02,979 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:29:02,987 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:29:02,987 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:29:02,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:29:02 BoogieIcfgContainer [2025-01-09 10:29:02,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:29:02,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:29:02,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:29:02,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:29:02,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:28:53" (1/3) ... [2025-01-09 10:29:02,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426136cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:29:02, skipping insertion in model container [2025-01-09 10:29:02,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:28:54" (2/3) ... [2025-01-09 10:29:02,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426136cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:29:02, skipping insertion in model container [2025-01-09 10:29:02,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:29:02" (3/3) ... [2025-01-09 10:29:02,994 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i [2025-01-09 10:29:03,003 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:29:03,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-50.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:29:03,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:29:03,050 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;@4451a5f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:29:03,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:29:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 10:29:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:29:03,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:03,063 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:29:03,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:03,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash -133465740, now seen corresponding path program 1 times [2025-01-09 10:29:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:29:03,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4343038] [2025-01-09 10:29:03,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:03,077 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 10:29:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:29:03,079 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 10:29:03,080 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 10:29:03,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:29:03,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:29:03,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:03,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:03,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 10:29:03,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:29:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 10:29:03,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:29:03,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:29:03,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4343038] [2025-01-09 10:29:03,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4343038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:29:03,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:29:03,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:29:03,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343280609] [2025-01-09 10:29:03,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:29:03,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:29:03,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:29:03,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:29:03,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:29:03,922 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:29:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:29:04,295 INFO L93 Difference]: Finished difference Result 201 states and 360 transitions. [2025-01-09 10:29:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:29:04,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 10:29:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:29:04,303 INFO L225 Difference]: With dead ends: 201 [2025-01-09 10:29:04,303 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 10:29:04,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:29:04,308 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 106 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:29:04,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 441 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:29:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 10:29:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 76. [2025-01-09 10:29:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 10:29:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 113 transitions. [2025-01-09 10:29:04,346 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 113 transitions. Word has length 161 [2025-01-09 10:29:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:29:04,347 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 113 transitions. [2025-01-09 10:29:04,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 10:29:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 113 transitions. [2025-01-09 10:29:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:29:04,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:04,350 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:29:04,370 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 10:29:04,551 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 10:29:04,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:04,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1144582990, now seen corresponding path program 1 times [2025-01-09 10:29:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:29:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728298833] [2025-01-09 10:29:04,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:04,553 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 10:29:04,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:29:04,554 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 10:29:04,555 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 10:29:04,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:29:05,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:29:05,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:05,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:05,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 10:29:05,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:29:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 10:29:06,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:29:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 10:29:08,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:29:08,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728298833] [2025-01-09 10:29:08,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728298833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:29:08,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:29:08,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 10:29:08,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805309574] [2025-01-09 10:29:08,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:29:08,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:29:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:29:08,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:29:08,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:29:08,026 INFO L87 Difference]: Start difference. First operand 76 states and 113 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 10:29:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:29:09,331 INFO L93 Difference]: Finished difference Result 157 states and 230 transitions. [2025-01-09 10:29:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:29:09,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 161 [2025-01-09 10:29:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:29:09,335 INFO L225 Difference]: With dead ends: 157 [2025-01-09 10:29:09,335 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 10:29:09,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:29:09,336 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 63 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:29:09,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 200 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:29:09,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 10:29:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-01-09 10:29:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 10:29:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2025-01-09 10:29:09,347 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 161 [2025-01-09 10:29:09,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:29:09,348 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-01-09 10:29:09,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 10:29:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2025-01-09 10:29:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 10:29:09,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:29:09,350 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:29:09,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 10:29:09,553 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 10:29:09,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:29:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:29:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1537610000, now seen corresponding path program 1 times [2025-01-09 10:29:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:29:09,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134908024] [2025-01-09 10:29:09,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:29:09,555 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 10:29:09,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:29:09,559 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 10:29:09,560 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 10:29:09,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 10:29:10,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 10:29:10,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:29:10,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:29:10,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 10:29:10,065 INFO L279 TraceCheckSpWp]: Computing forward predicates...