./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-16.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_codestructure_dependencies_file-16.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 a8df85eecddb48509e0971f4d1787bfa43b62f177928dde1b761c67df7ffb019 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:24:20,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:24:20,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:24:20,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:24:20,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:24:20,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:24:20,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:24:20,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:24:20,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:24:20,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:24:20,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:24:20,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:24:20,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:24:20,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:24:20,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:24:20,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:20,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:20,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:24:20,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:24:20,100 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 -> a8df85eecddb48509e0971f4d1787bfa43b62f177928dde1b761c67df7ffb019 [2025-01-09 08:24:20,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:24:20,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:24:20,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:24:20,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:24:20,331 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:24:20,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-16.i [2025-01-09 08:24:21,479 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/751c1b749/7055c0a301954d10a657fbc4e16142a6/FLAGbe3abdc41 [2025-01-09 08:24:21,744 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:24:21,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-16.i [2025-01-09 08:24:21,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/751c1b749/7055c0a301954d10a657fbc4e16142a6/FLAGbe3abdc41 [2025-01-09 08:24:22,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/751c1b749/7055c0a301954d10a657fbc4e16142a6 [2025-01-09 08:24:22,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:24:22,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:24:22,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:24:22,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:24:22,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:24:22,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7d3ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22, skipping insertion in model container [2025-01-09 08:24:22,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:24:22,189 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_codestructure_dependencies_file-16.i[919,932] [2025-01-09 08:24:22,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:24:22,265 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:24:22,277 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_codestructure_dependencies_file-16.i[919,932] [2025-01-09 08:24:22,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:24:22,309 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:24:22,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22 WrapperNode [2025-01-09 08:24:22,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:24:22,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:24:22,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:24:22,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:24:22,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,341 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-01-09 08:24:22,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:24:22,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:24:22,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:24:22,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:24:22,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,361 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 08:24:22,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:24:22,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:24:22,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:24:22,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:24:22,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (1/1) ... [2025-01-09 08:24:22,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:22,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:24:22,398 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 08:24:22,400 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 08:24:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:24:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:24:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:24:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:24:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:24:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:24:22,476 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:24:22,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:24:22,728 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 08:24:22,728 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:24:22,736 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:24:22,737 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:24:22,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:22 BoogieIcfgContainer [2025-01-09 08:24:22,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:24:22,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:24:22,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:24:22,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:24:22,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:24:22" (1/3) ... [2025-01-09 08:24:22,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aeb1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:24:22, skipping insertion in model container [2025-01-09 08:24:22,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:22" (2/3) ... [2025-01-09 08:24:22,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aeb1a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:24:22, skipping insertion in model container [2025-01-09 08:24:22,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:22" (3/3) ... [2025-01-09 08:24:22,743 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-16.i [2025-01-09 08:24:22,753 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:24:22,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-16.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:24:22,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:24:22,801 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;@6117f46f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:24:22,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:24:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 08:24:22,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 08:24:22,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:22,817 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:22,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1277960278, now seen corresponding path program 1 times [2025-01-09 08:24:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:22,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573738701] [2025-01-09 08:24:22,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:22,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 08:24:22,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 08:24:22,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:22,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 08:24:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:24:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573738701] [2025-01-09 08:24:23,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573738701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:24:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812220039] [2025-01-09 08:24:23,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:23,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:24:23,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:24:23,035 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 08:24:23,037 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 08:24:23,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 08:24:23,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 08:24:23,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:23,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:23,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:24:23,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:24:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 08:24:23,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:24:23,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812220039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:23,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:24:23,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:24:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694521478] [2025-01-09 08:24:23,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:23,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:24:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:24:23,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:24:23,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:24:23,231 INFO L87 Difference]: Start difference. First operand has 73 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 08:24:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:23,253 INFO L93 Difference]: Finished difference Result 140 states and 241 transitions. [2025-01-09 08:24:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:24:23,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 143 [2025-01-09 08:24:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:23,262 INFO L225 Difference]: With dead ends: 140 [2025-01-09 08:24:23,262 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 08:24:23,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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 08:24:23,269 INFO L435 NwaCegarLoop]: 107 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, 107 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 08:24:23,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:24:23,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 08:24:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 08:24:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 08:24:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2025-01-09 08:24:23,308 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 143 [2025-01-09 08:24:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:23,308 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2025-01-09 08:24:23,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 08:24:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2025-01-09 08:24:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 08:24:23,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:23,312 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:23,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:24:23,517 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 08:24:23,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:23,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:23,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1260471566, now seen corresponding path program 1 times [2025-01-09 08:24:23,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:23,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332206515] [2025-01-09 08:24:23,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:23,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:23,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 08:24:23,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 08:24:23,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:23,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 08:24:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:24:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332206515] [2025-01-09 08:24:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332206515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:23,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:24:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415199318] [2025-01-09 08:24:23,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:23,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:24:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:24:23,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:24:23,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:24:23,937 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:24,119 INFO L93 Difference]: Finished difference Result 233 states and 349 transitions. [2025-01-09 08:24:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:24:24,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-01-09 08:24:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:24,122 INFO L225 Difference]: With dead ends: 233 [2025-01-09 08:24:24,123 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 08:24:24,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:24:24,124 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 173 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:24,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 337 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:24:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 08:24:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 114. [2025-01-09 08:24:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 88 states have internal predecessors, (129), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 08:24:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 177 transitions. [2025-01-09 08:24:24,140 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 177 transitions. Word has length 143 [2025-01-09 08:24:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:24,140 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 177 transitions. [2025-01-09 08:24:24,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 177 transitions. [2025-01-09 08:24:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 08:24:24,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:24,145 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:24,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:24:24,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:24,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1847277580, now seen corresponding path program 1 times [2025-01-09 08:24:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598692667] [2025-01-09 08:24:24,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:24,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:24,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 08:24:24,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 08:24:24,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:24,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 08:24:24,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:24:24,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598692667] [2025-01-09 08:24:24,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598692667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:24,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:24,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:24:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200244171] [2025-01-09 08:24:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:24,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:24:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:24:24,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:24:24,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:24:24,392 INFO L87 Difference]: Start difference. First operand 114 states and 177 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:24,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:24,540 INFO L93 Difference]: Finished difference Result 294 states and 444 transitions. [2025-01-09 08:24:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:24:24,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-01-09 08:24:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:24,544 INFO L225 Difference]: With dead ends: 294 [2025-01-09 08:24:24,544 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 08:24:24,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:24:24,545 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 197 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:24,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 423 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:24:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 08:24:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 159. [2025-01-09 08:24:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 126 states have (on average 1.492063492063492) internal successors, (188), 128 states have internal predecessors, (188), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:24:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 244 transitions. [2025-01-09 08:24:24,575 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 244 transitions. Word has length 143 [2025-01-09 08:24:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:24,576 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 244 transitions. [2025-01-09 08:24:24,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2025-01-09 08:24:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 08:24:24,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:24,577 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:24,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:24:24,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:24,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2054662706, now seen corresponding path program 1 times [2025-01-09 08:24:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717769561] [2025-01-09 08:24:24,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:24,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:24,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 08:24:24,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 08:24:24,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:24,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 08:24:25,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:24:25,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717769561] [2025-01-09 08:24:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717769561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:25,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:25,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:24:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845972859] [2025-01-09 08:24:25,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:25,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:24:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:24:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:24:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:24:25,834 INFO L87 Difference]: Start difference. First operand 159 states and 244 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:26,131 INFO L93 Difference]: Finished difference Result 344 states and 532 transitions. [2025-01-09 08:24:26,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:24:26,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-01-09 08:24:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:26,135 INFO L225 Difference]: With dead ends: 344 [2025-01-09 08:24:26,135 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 08:24:26,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:24:26,136 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 36 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:26,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 277 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:24:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 08:24:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2025-01-09 08:24:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 138 states have (on average 1.5) internal successors, (207), 140 states have internal predecessors, (207), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:24:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 263 transitions. [2025-01-09 08:24:26,158 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 263 transitions. Word has length 143 [2025-01-09 08:24:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:26,159 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 263 transitions. [2025-01-09 08:24:26,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 263 transitions. [2025-01-09 08:24:26,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 08:24:26,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:26,161 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:26,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:24:26,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:26,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2023378480, now seen corresponding path program 1 times [2025-01-09 08:24:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968645681] [2025-01-09 08:24:26,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:26,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:26,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 08:24:26,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 08:24:26,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:26,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 08:24:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:24:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968645681] [2025-01-09 08:24:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968645681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:27,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:24:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566348099] [2025-01-09 08:24:27,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:27,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:24:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:24:27,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:24:27,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:24:27,479 INFO L87 Difference]: Start difference. First operand 171 states and 263 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:27,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:27,704 INFO L93 Difference]: Finished difference Result 353 states and 548 transitions. [2025-01-09 08:24:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:24:27,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-01-09 08:24:27,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:27,706 INFO L225 Difference]: With dead ends: 353 [2025-01-09 08:24:27,706 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 08:24:27,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:24:27,708 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 79 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:27,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 228 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:24:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 08:24:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2025-01-09 08:24:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 126 states have (on average 1.4603174603174602) internal successors, (184), 128 states have internal predecessors, (184), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:24:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 240 transitions. [2025-01-09 08:24:27,730 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 240 transitions. Word has length 143 [2025-01-09 08:24:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:27,730 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 240 transitions. [2025-01-09 08:24:27,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 240 transitions. [2025-01-09 08:24:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 08:24:27,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:27,732 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:27,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:24:27,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:27,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:27,732 INFO L85 PathProgramCache]: Analyzing trace with hash -751821550, now seen corresponding path program 1 times [2025-01-09 08:24:27,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:27,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210281826] [2025-01-09 08:24:27,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:27,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 08:24:27,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 08:24:27,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:27,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 08:24:27,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:24:27,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210281826] [2025-01-09 08:24:27,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210281826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:27,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:27,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:24:27,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399702208] [2025-01-09 08:24:27,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:27,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:24:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:24:27,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:24:27,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:24:27,886 INFO L87 Difference]: Start difference. First operand 159 states and 240 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:28,002 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2025-01-09 08:24:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:24:28,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2025-01-09 08:24:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:28,006 INFO L225 Difference]: With dead ends: 498 [2025-01-09 08:24:28,006 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 08:24:28,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 08:24:28,009 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 97 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:28,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 325 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:24:28,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 08:24:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 290. [2025-01-09 08:24:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 225 states have (on average 1.44) internal successors, (324), 229 states have internal predecessors, (324), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 08:24:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 436 transitions. [2025-01-09 08:24:28,035 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 436 transitions. Word has length 144 [2025-01-09 08:24:28,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:28,035 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 436 transitions. [2025-01-09 08:24:28,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 08:24:28,035 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 436 transitions. [2025-01-09 08:24:28,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 08:24:28,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:28,036 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:28,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:24:28,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:28,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:28,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1988247219, now seen corresponding path program 1 times [2025-01-09 08:24:28,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:28,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158570248] [2025-01-09 08:24:28,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:28,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:24:28,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:24:28,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:28,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 08:24:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:24:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158570248] [2025-01-09 08:24:28,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158570248] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:24:28,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807511836] [2025-01-09 08:24:28,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:28,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:24:28,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:24:28,243 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 08:24:28,244 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 08:24:28,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:24:28,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:24:28,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:28,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:28,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 08:24:28,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:24:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 301 proven. 51 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-01-09 08:24:28,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:24:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 08:24:28,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807511836] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:24:28,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:24:28,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-09 08:24:28,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398492607] [2025-01-09 08:24:28,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:24:28,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 08:24:28,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:24:28,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 08:24:28,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:24:28,718 INFO L87 Difference]: Start difference. First operand 290 states and 436 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 08:24:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:29,292 INFO L93 Difference]: Finished difference Result 655 states and 955 transitions. [2025-01-09 08:24:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 08:24:29,292 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 145 [2025-01-09 08:24:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:29,294 INFO L225 Difference]: With dead ends: 655 [2025-01-09 08:24:29,295 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 08:24:29,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 286 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=597, Unknown=0, NotChecked=0, Total=870 [2025-01-09 08:24:29,296 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 411 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:24:29,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 422 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 08:24:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 08:24:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 207. [2025-01-09 08:24:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 154 states have (on average 1.4415584415584415) internal successors, (222), 155 states have internal predecessors, (222), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 08:24:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 314 transitions. [2025-01-09 08:24:29,311 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 314 transitions. Word has length 145 [2025-01-09 08:24:29,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:29,311 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 314 transitions. [2025-01-09 08:24:29,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 08:24:29,311 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 314 transitions. [2025-01-09 08:24:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 08:24:29,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:29,312 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:29,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:24:29,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:24:29,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:29,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1987617333, now seen corresponding path program 1 times [2025-01-09 08:24:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:24:29,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655824057] [2025-01-09 08:24:29,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:29,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:24:29,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:24:29,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:24:29,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:29,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:24:29,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490019619] [2025-01-09 08:24:29,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:29,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:24:29,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:24:29,557 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 08:24:29,559 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 08:24:29,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:24:29,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:24:29,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:29,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:24:29,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:24:29,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 08:24:29,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 08:24:29,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:29,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:24:29,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:24:29,774 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:24:29,775 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:24:29,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 08:24:29,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:24:29,979 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:24:30,045 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:24:30,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:24:30 BoogieIcfgContainer [2025-01-09 08:24:30,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:24:30,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:24:30,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:24:30,050 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:24:30,051 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:22" (3/4) ... [2025-01-09 08:24:30,053 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:24:30,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:24:30,054 INFO L158 Benchmark]: Toolchain (without parser) took 7992.71ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 153.9MB in the beginning and 182.6MB in the end (delta: -28.7MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2025-01-09 08:24:30,054 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:24:30,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.63ms. Allocated memory is still 201.3MB. Free memory was 153.5MB in the beginning and 139.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:24:30,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.05ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 137.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:24:30,054 INFO L158 Benchmark]: Boogie Preprocessor took 28.26ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 134.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:24:30,054 INFO L158 Benchmark]: RCFGBuilder took 365.96ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 113.2MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 08:24:30,055 INFO L158 Benchmark]: TraceAbstraction took 7310.40ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 112.8MB in the beginning and 182.7MB in the end (delta: -69.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2025-01-09 08:24:30,055 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 293.6MB. Free memory was 182.7MB in the beginning and 182.6MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:24:30,056 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.94ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.63ms. Allocated memory is still 201.3MB. Free memory was 153.5MB in the beginning and 139.7MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.05ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 137.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.26ms. Allocated memory is still 201.3MB. Free memory was 137.2MB in the beginning and 134.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.96ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 113.2MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7310.40ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 112.8MB in the beginning and 182.7MB in the end (delta: -69.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 293.6MB. Free memory was 182.7MB in the beginning and 182.6MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. 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 86, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someUnaryFLOAToperation at line 86, overapproximation of someBinaryArithmeticFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] unsigned char var_1_4 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = 64; [L26] unsigned short int var_1_7 = 8; [L27] unsigned short int var_1_8 = 256; [L28] signed long int var_1_9 = 2; [L29] signed long int var_1_10 = 1441729073; [L30] unsigned short int var_1_11 = 32; [L31] double var_1_12 = 7.6; [L32] double var_1_13 = 127.8; [L33] signed char var_1_14 = 32; [L34] signed char var_1_15 = 50; [L35] signed char var_1_16 = 0; [L36] signed char var_1_17 = 16; [L37] float var_1_18 = 0.4; [L38] unsigned char var_1_19 = 0; [L39] float var_1_20 = 24.4; [L40] float var_1_21 = 500.5; [L41] float var_1_22 = 99.324; [L42] unsigned short int var_1_23 = 128; [L43] unsigned short int last_1_var_1_7 = 8; [L44] unsigned short int last_1_var_1_11 = 32; [L45] signed char last_1_var_1_14 = 32; [L46] unsigned short int last_1_var_1_23 = 128; VAL [isInitial=0, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L137] isInitial = 1 [L138] FCALL initially() [L140] CALL updateLastVariables() [L127] last_1_var_1_7 = var_1_7 [L128] last_1_var_1_11 = var_1_11 [L129] last_1_var_1_14 = var_1_14 [L130] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L140] RET updateLastVariables() [L141] CALL updateVariables() [L90] var_1_4 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L91] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L92] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L92] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L93] var_1_5 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L94] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L95] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L95] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] var_1_6 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L97] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L98] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L99] var_1_8 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L100] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L101] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L102] var_1_10 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L103] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L104] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L105] var_1_13 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L106] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L107] var_1_15 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L108] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L109] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L109] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L110] var_1_16 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L111] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L112] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L112] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L113] var_1_17 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L114] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L115] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L115] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L116] var_1_19 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L117] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L118] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L118] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L119] var_1_20 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L120] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L121] var_1_21 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L122] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L123] var_1_22 = __VERIFIER_nondet_float() [L124] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L124] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L141] RET updateVariables() [L142] CALL step() [L50] COND FALSE !((last_1_var_1_23 / -50) >= last_1_var_1_11) [L57] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L59] COND FALSE !(var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=2] [L62] COND TRUE var_1_6 > 128 [L63] var_1_9 = (var_1_8 - (var_1_10 - var_1_1)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=-1073741791] [L65] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=-1073741791] [L65] COND FALSE !(((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) [L70] var_1_11 = var_1_8 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=32, var_1_9=-1073741791] [L72] COND TRUE last_1_var_1_7 < var_1_6 [L73] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741791] [L75] COND FALSE !(var_1_9 < (- var_1_10)) [L80] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741791] [L82] COND TRUE last_1_var_1_14 <= var_1_8 [L83] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741791] [L85] COND TRUE var_1_4 || var_1_19 [L86] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741791] [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741791] [L133] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741791] [L133] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741791] [L133-L134] return (((((((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_9 < (- var_1_10)) ? ((var_1_8 <= var_1_9) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((last_1_var_1_14 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741791] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741823, var_1_11=32, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=161, var_1_8=32, var_1_9=-1073741791] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 999 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 993 mSDsluCounter, 2119 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1364 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 992 IncrementalHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 755 mSDtfsCounter, 992 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 448 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=6, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 336 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1582 NumberOfCodeBlocks, 1582 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1427 ConstructedInterpolants, 0 QuantifiedInterpolants, 4228 SizeOfPredicates, 4 NumberOfNonLiveVariables, 690 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 9045/9240 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 08:24:30,080 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_codestructure_dependencies_file-16.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 a8df85eecddb48509e0971f4d1787bfa43b62f177928dde1b761c67df7ffb019 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:24:31,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:24:32,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 08:24:32,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:24:32,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:24:32,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:24:32,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:24:32,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:24:32,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:24:32,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:24:32,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:24:32,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:24:32,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:24:32,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:24:32,035 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:24:32,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:24:32,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:24:32,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:24:32,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:24:32,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:24:32,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:24:32,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:24:32,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:24:32,036 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:24:32,036 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:24:32,037 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:24:32,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:24:32,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:24:32,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:24:32,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:24:32,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:24:32,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:24:32,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:24:32,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:24:32,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:32,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:32,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:24:32,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:24:32,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:24:32,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:24:32,039 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 -> a8df85eecddb48509e0971f4d1787bfa43b62f177928dde1b761c67df7ffb019 [2025-01-09 08:24:32,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:24:32,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:24:32,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:24:32,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:24:32,297 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:24:32,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-16.i [2025-01-09 08:24:33,503 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/585e19341/87c801d8070f4102b1921f2f1c7b6f89/FLAGd190ecd05 [2025-01-09 08:24:33,700 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:24:33,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-16.i [2025-01-09 08:24:33,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/585e19341/87c801d8070f4102b1921f2f1c7b6f89/FLAGd190ecd05 [2025-01-09 08:24:34,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/585e19341/87c801d8070f4102b1921f2f1c7b6f89 [2025-01-09 08:24:34,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:24:34,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:24:34,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:24:34,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:24:34,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:24:34,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470e2ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34, skipping insertion in model container [2025-01-09 08:24:34,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:24:34,182 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_codestructure_dependencies_file-16.i[919,932] [2025-01-09 08:24:34,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:24:34,243 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:24:34,251 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_codestructure_dependencies_file-16.i[919,932] [2025-01-09 08:24:34,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:24:34,282 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:24:34,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34 WrapperNode [2025-01-09 08:24:34,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:24:34,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:24:34,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:24:34,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:24:34,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,310 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-01-09 08:24:34,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:24:34,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:24:34,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:24:34,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:24:34,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,333 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 08:24:34,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:24:34,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:24:34,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:24:34,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:24:34,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (1/1) ... [2025-01-09 08:24:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:24:34,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:24:34,401 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 08:24:34,404 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 08:24:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:24:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:24:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:24:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:24:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:24:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:24:34,480 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:24:34,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:24:35,908 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:24:35,908 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:24:35,914 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:24:35,915 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:24:35,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:35 BoogieIcfgContainer [2025-01-09 08:24:35,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:24:35,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:24:35,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:24:35,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:24:35,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:24:34" (1/3) ... [2025-01-09 08:24:35,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60296f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:24:35, skipping insertion in model container [2025-01-09 08:24:35,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:24:34" (2/3) ... [2025-01-09 08:24:35,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60296f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:24:35, skipping insertion in model container [2025-01-09 08:24:35,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:24:35" (3/3) ... [2025-01-09 08:24:35,921 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-16.i [2025-01-09 08:24:35,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:24:35,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-16.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:24:35,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:24:35,987 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;@7065aca6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:24:35,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:24:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 08:24:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 08:24:35,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:35,998 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:35,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:36,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:36,004 INFO L85 PathProgramCache]: Analyzing trace with hash -157791875, now seen corresponding path program 1 times [2025-01-09 08:24:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:24:36,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063349083] [2025-01-09 08:24:36,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:36,016 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 08:24:36,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:24:36,018 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 08:24:36,021 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 08:24:36,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 08:24:36,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 08:24:36,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:36,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:36,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:24:36,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:24:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 08:24:36,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:24:36,418 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:24:36,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063349083] [2025-01-09 08:24:36,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063349083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:24:36,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:24:36,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:24:36,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753992315] [2025-01-09 08:24:36,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:24:36,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:24:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:24:36,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:24:36,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:24:36,440 INFO L87 Difference]: Start difference. First operand has 64 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 08:24:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:24:36,457 INFO L93 Difference]: Finished difference Result 122 states and 213 transitions. [2025-01-09 08:24:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:24:36,460 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 140 [2025-01-09 08:24:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:24:36,464 INFO L225 Difference]: With dead ends: 122 [2025-01-09 08:24:36,464 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 08:24:36,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 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 08:24:36,468 INFO L435 NwaCegarLoop]: 93 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, 93 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 08:24:36,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:24:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 08:24:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 08:24:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 08:24:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2025-01-09 08:24:36,500 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 140 [2025-01-09 08:24:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:24:36,501 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2025-01-09 08:24:36,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 08:24:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2025-01-09 08:24:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 08:24:36,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:24:36,506 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:36,522 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 08:24:36,706 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 08:24:36,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:24:36,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:24:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash -519802059, now seen corresponding path program 1 times [2025-01-09 08:24:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:24:36,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198589815] [2025-01-09 08:24:36,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:24:36,708 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 08:24:36,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:24:36,710 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 08:24:36,712 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 08:24:36,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 08:24:37,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 08:24:37,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:24:37,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:24:37,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 08:24:37,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:25:34,239 WARN L286 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)