./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8eb615b84715d4e5603f49b8da12039ac524d65195b0f458b0aca18ed675dad9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:37:59,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:37:59,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:37:59,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:37:59,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:37:59,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:37:59,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:37:59,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:37:59,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:37:59,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:37:59,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:37:59,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:37:59,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:37:59,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:37:59,883 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:37:59,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:37:59,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:37:59,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:37:59,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:37:59,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:37:59,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:37:59,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:37:59,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:37:59,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:37:59,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:37:59,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:37:59,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:37:59,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:37:59,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:37:59,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:37:59,885 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/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 -> 8eb615b84715d4e5603f49b8da12039ac524d65195b0f458b0aca18ed675dad9 [2025-03-08 12:38:00,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:38:00,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:38:00,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:38:00,158 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:38:00,158 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:38:00,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-03-08 12:38:01,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af36cdb4c/80fe66ccac104fe1a0d864a0f593bd27/FLAG476406160 [2025-03-08 12:38:01,665 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:38:01,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-03-08 12:38:01,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af36cdb4c/80fe66ccac104fe1a0d864a0f593bd27/FLAG476406160 [2025-03-08 12:38:01,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af36cdb4c/80fe66ccac104fe1a0d864a0f593bd27 [2025-03-08 12:38:01,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:38:01,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:38:01,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:38:01,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:38:01,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:38:01,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:01" (1/1) ... [2025-03-08 12:38:01,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137ce0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:01, skipping insertion in model container [2025-03-08 12:38:01,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:01" (1/1) ... [2025-03-08 12:38:02,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:38:02,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i[919,932] [2025-03-08 12:38:02,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:38:02,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:38:02,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i[919,932] [2025-03-08 12:38:02,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:38:02,271 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:38:02,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02 WrapperNode [2025-03-08 12:38:02,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:38:02,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:38:02,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:38:02,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:38:02,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,324 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-08 12:38:02,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:38:02,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:38:02,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:38:02,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:38:02,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,354 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-03-08 12:38:02,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:38:02,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:38:02,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:38:02,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:38:02,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (1/1) ... [2025-03-08 12:38:02,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:38:02,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:38:02,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:38:02,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:38:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:38:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:38:02,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:38:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:38:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:38:02,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:38:02,498 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:38:02,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:38:02,801 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc property_#t~bitwise24#1;havoc property_#t~short25#1; [2025-03-08 12:38:02,840 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 12:38:02,842 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:38:02,862 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:38:02,862 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:38:02,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:02 BoogieIcfgContainer [2025-03-08 12:38:02,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:38:02,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:38:02,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:38:02,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:38:02,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:38:01" (1/3) ... [2025-03-08 12:38:02,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b132b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:02, skipping insertion in model container [2025-03-08 12:38:02,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:02" (2/3) ... [2025-03-08 12:38:02,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b132b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:02, skipping insertion in model container [2025-03-08 12:38:02,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:02" (3/3) ... [2025-03-08 12:38:02,870 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-03-08 12:38:02,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:38:02,883 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:38:02,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:38:02,945 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;@6caccfb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:38:02,946 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:38:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 66 states have internal predecessors, (94), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 12:38:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 12:38:02,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:02,964 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:02,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:02,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash -811648411, now seen corresponding path program 1 times [2025-03-08 12:38:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:02,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239562470] [2025-03-08 12:38:02,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:03,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 12:38:03,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 12:38:03,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:03,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 12:38:03,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:03,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239562470] [2025-03-08 12:38:03,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239562470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:38:03,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551567513] [2025-03-08 12:38:03,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:03,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:38:03,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:38:03,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:38:03,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:38:03,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 12:38:03,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 12:38:03,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:03,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:03,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:38:03,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:38:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 12:38:03,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:38:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551567513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:03,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:38:03,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:38:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171761447] [2025-03-08 12:38:03,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:03,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:38:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:03,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:38:03,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:38:03,526 INFO L87 Difference]: Start difference. First operand has 101 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 66 states have internal predecessors, (94), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:38:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:03,555 INFO L93 Difference]: Finished difference Result 196 states and 348 transitions. [2025-03-08 12:38:03,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:38:03,557 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 209 [2025-03-08 12:38:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:03,561 INFO L225 Difference]: With dead ends: 196 [2025-03-08 12:38:03,561 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 12:38:03,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 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-03-08 12:38:03,565 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:03,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:38:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 12:38:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-08 12:38:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 12:38:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 154 transitions. [2025-03-08 12:38:03,594 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 154 transitions. Word has length 209 [2025-03-08 12:38:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:03,594 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 154 transitions. [2025-03-08 12:38:03,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:38:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 154 transitions. [2025-03-08 12:38:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 12:38:03,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:03,597 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:03,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:38:03,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:38:03,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:03,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:03,802 INFO L85 PathProgramCache]: Analyzing trace with hash 638322794, now seen corresponding path program 1 times [2025-03-08 12:38:03,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:03,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460230462] [2025-03-08 12:38:03,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:03,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:03,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 12:38:03,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 12:38:03,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:03,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:04,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:04,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460230462] [2025-03-08 12:38:04,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460230462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:04,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:04,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:38:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805048908] [2025-03-08 12:38:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:04,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:38:04,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:04,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:38:04,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:38:04,084 INFO L87 Difference]: Start difference. First operand 98 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:04,180 INFO L93 Difference]: Finished difference Result 288 states and 456 transitions. [2025-03-08 12:38:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:38:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-03-08 12:38:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:04,183 INFO L225 Difference]: With dead ends: 288 [2025-03-08 12:38:04,183 INFO L226 Difference]: Without dead ends: 193 [2025-03-08 12:38:04,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:38:04,186 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 82 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:04,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 444 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:38:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-08 12:38:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-03-08 12:38:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 122 states have internal predecessors, (170), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 12:38:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 302 transitions. [2025-03-08 12:38:04,245 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 302 transitions. Word has length 209 [2025-03-08 12:38:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:04,245 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 302 transitions. [2025-03-08 12:38:04,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 302 transitions. [2025-03-08 12:38:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 12:38:04,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:04,249 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:04,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:38:04,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:04,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 993068443, now seen corresponding path program 1 times [2025-03-08 12:38:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550585763] [2025-03-08 12:38:04,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:04,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 12:38:04,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 12:38:04,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:04,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:04,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:04,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550585763] [2025-03-08 12:38:04,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550585763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:04,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:04,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:38:04,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875925356] [2025-03-08 12:38:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:04,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:38:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:04,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:38:04,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:38:04,693 INFO L87 Difference]: Start difference. First operand 191 states and 302 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:04,990 INFO L93 Difference]: Finished difference Result 633 states and 1007 transitions. [2025-03-08 12:38:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:38:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-03-08 12:38:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:04,995 INFO L225 Difference]: With dead ends: 633 [2025-03-08 12:38:04,996 INFO L226 Difference]: Without dead ends: 445 [2025-03-08 12:38:04,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-08 12:38:04,997 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 152 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:04,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 560 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:38:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-08 12:38:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 379. [2025-03-08 12:38:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 242 states have (on average 1.396694214876033) internal successors, (338), 242 states have internal predecessors, (338), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 12:38:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 602 transitions. [2025-03-08 12:38:05,040 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 602 transitions. Word has length 210 [2025-03-08 12:38:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:05,040 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 602 transitions. [2025-03-08 12:38:05,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 602 transitions. [2025-03-08 12:38:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 12:38:05,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:05,043 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:05,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:38:05,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:05,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1204419356, now seen corresponding path program 1 times [2025-03-08 12:38:05,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:05,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420180700] [2025-03-08 12:38:05,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:05,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:05,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 12:38:05,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 12:38:05,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:05,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:05,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:05,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420180700] [2025-03-08 12:38:05,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420180700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:05,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:05,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:38:05,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560770037] [2025-03-08 12:38:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:05,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:38:05,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:05,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:38:05,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:38:05,319 INFO L87 Difference]: Start difference. First operand 379 states and 602 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:05,928 INFO L93 Difference]: Finished difference Result 1179 states and 1873 transitions. [2025-03-08 12:38:05,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:38:05,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-03-08 12:38:05,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:05,933 INFO L225 Difference]: With dead ends: 1179 [2025-03-08 12:38:05,933 INFO L226 Difference]: Without dead ends: 803 [2025-03-08 12:38:05,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:38:05,935 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 423 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:05,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 981 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:38:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-08 12:38:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 421. [2025-03-08 12:38:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 284 states have (on average 1.4507042253521127) internal successors, (412), 284 states have internal predecessors, (412), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-08 12:38:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 676 transitions. [2025-03-08 12:38:05,994 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 676 transitions. Word has length 210 [2025-03-08 12:38:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:05,995 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 676 transitions. [2025-03-08 12:38:05,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 676 transitions. [2025-03-08 12:38:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 12:38:05,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:05,997 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:05,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:38:05,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:05,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1903355987, now seen corresponding path program 1 times [2025-03-08 12:38:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:05,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942661276] [2025-03-08 12:38:05,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:05,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:06,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 12:38:06,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 12:38:06,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:06,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:06,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942661276] [2025-03-08 12:38:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942661276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:06,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:06,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 12:38:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907479667] [2025-03-08 12:38:06,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:06,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:38:06,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:06,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:38:06,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:38:06,360 INFO L87 Difference]: Start difference. First operand 421 states and 676 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:38:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:07,015 INFO L93 Difference]: Finished difference Result 900 states and 1420 transitions. [2025-03-08 12:38:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:38:07,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 211 [2025-03-08 12:38:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:07,023 INFO L225 Difference]: With dead ends: 900 [2025-03-08 12:38:07,023 INFO L226 Difference]: Without dead ends: 709 [2025-03-08 12:38:07,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:38:07,025 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 500 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:07,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1011 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:38:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-08 12:38:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 643. [2025-03-08 12:38:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 422 states have (on average 1.4028436018957346) internal successors, (592), 426 states have internal predecessors, (592), 212 states have call successors, (212), 8 states have call predecessors, (212), 8 states have return successors, (212), 208 states have call predecessors, (212), 212 states have call successors, (212) [2025-03-08 12:38:07,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1016 transitions. [2025-03-08 12:38:07,108 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1016 transitions. Word has length 211 [2025-03-08 12:38:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:07,109 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 1016 transitions. [2025-03-08 12:38:07,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 12:38:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1016 transitions. [2025-03-08 12:38:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 12:38:07,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:07,111 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:07,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:38:07,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:07,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash -550046290, now seen corresponding path program 1 times [2025-03-08 12:38:07,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:07,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68481097] [2025-03-08 12:38:07,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:07,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 12:38:07,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 12:38:07,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:07,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:07,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:07,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68481097] [2025-03-08 12:38:07,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68481097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:07,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:07,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:38:07,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295812025] [2025-03-08 12:38:07,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:07,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:38:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:07,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:38:07,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:38:07,331 INFO L87 Difference]: Start difference. First operand 643 states and 1016 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:07,739 INFO L93 Difference]: Finished difference Result 1376 states and 2168 transitions. [2025-03-08 12:38:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:38:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-03-08 12:38:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:07,745 INFO L225 Difference]: With dead ends: 1376 [2025-03-08 12:38:07,745 INFO L226 Difference]: Without dead ends: 736 [2025-03-08 12:38:07,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:38:07,747 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 205 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:07,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 647 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:38:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-08 12:38:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 667. [2025-03-08 12:38:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 432 states have (on average 1.3888888888888888) internal successors, (600), 436 states have internal predecessors, (600), 225 states have call successors, (225), 9 states have call predecessors, (225), 9 states have return successors, (225), 221 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-08 12:38:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1050 transitions. [2025-03-08 12:38:07,818 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1050 transitions. Word has length 211 [2025-03-08 12:38:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:07,819 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 1050 transitions. [2025-03-08 12:38:07,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1050 transitions. [2025-03-08 12:38:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 12:38:07,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:07,821 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:07,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:38:07,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:07,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1485262778, now seen corresponding path program 1 times [2025-03-08 12:38:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080154316] [2025-03-08 12:38:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:07,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 12:38:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 12:38:07,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:08,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:08,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080154316] [2025-03-08 12:38:08,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080154316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:08,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:08,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:38:08,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997412218] [2025-03-08 12:38:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:08,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:38:08,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:08,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:38:08,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:38:08,256 INFO L87 Difference]: Start difference. First operand 667 states and 1050 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:08,609 INFO L93 Difference]: Finished difference Result 1089 states and 1724 transitions. [2025-03-08 12:38:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:38:08,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-03-08 12:38:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:08,614 INFO L225 Difference]: With dead ends: 1089 [2025-03-08 12:38:08,615 INFO L226 Difference]: Without dead ends: 900 [2025-03-08 12:38:08,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:38:08,616 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 387 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:08,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 655 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:38:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-08 12:38:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 693. [2025-03-08 12:38:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 458 states have (on average 1.4148471615720524) internal successors, (648), 462 states have internal predecessors, (648), 225 states have call successors, (225), 9 states have call predecessors, (225), 9 states have return successors, (225), 221 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-08 12:38:08,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1098 transitions. [2025-03-08 12:38:08,696 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1098 transitions. Word has length 211 [2025-03-08 12:38:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:08,696 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1098 transitions. [2025-03-08 12:38:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1098 transitions. [2025-03-08 12:38:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 12:38:08,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:08,698 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:08,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:38:08,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:08,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:08,699 INFO L85 PathProgramCache]: Analyzing trace with hash -455844150, now seen corresponding path program 1 times [2025-03-08 12:38:08,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:08,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510904559] [2025-03-08 12:38:08,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:08,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 12:38:08,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 12:38:08,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:08,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:08,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510904559] [2025-03-08 12:38:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510904559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:08,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:08,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:38:08,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729914105] [2025-03-08 12:38:08,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:08,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:38:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:08,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:38:08,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:38:08,825 INFO L87 Difference]: Start difference. First operand 693 states and 1098 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:08,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:08,972 INFO L93 Difference]: Finished difference Result 1733 states and 2746 transitions. [2025-03-08 12:38:08,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:38:08,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-03-08 12:38:08,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:08,979 INFO L225 Difference]: With dead ends: 1733 [2025-03-08 12:38:08,979 INFO L226 Difference]: Without dead ends: 1043 [2025-03-08 12:38:08,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:38:08,982 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 127 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:08,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 398 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:38:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2025-03-08 12:38:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 759. [2025-03-08 12:38:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 524 states have (on average 1.4541984732824427) internal successors, (762), 528 states have internal predecessors, (762), 225 states have call successors, (225), 9 states have call predecessors, (225), 9 states have return successors, (225), 221 states have call predecessors, (225), 225 states have call successors, (225) [2025-03-08 12:38:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1212 transitions. [2025-03-08 12:38:09,075 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1212 transitions. Word has length 211 [2025-03-08 12:38:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:09,076 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1212 transitions. [2025-03-08 12:38:09,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:09,076 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1212 transitions. [2025-03-08 12:38:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 12:38:09,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:09,079 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:09,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:38:09,080 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:09,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash -696116676, now seen corresponding path program 1 times [2025-03-08 12:38:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:09,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54217095] [2025-03-08 12:38:09,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:09,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:09,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 12:38:09,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 12:38:09,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:09,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 12:38:09,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:09,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54217095] [2025-03-08 12:38:09,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54217095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:38:09,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921288697] [2025-03-08 12:38:09,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:38:09,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:38:09,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:38:09,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:38:09,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 12:38:09,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 12:38:09,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:09,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:09,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 12:38:09,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:38:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-08 12:38:09,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:38:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-03-08 12:38:10,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921288697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:38:10,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:38:10,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2025-03-08 12:38:10,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297449617] [2025-03-08 12:38:10,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:38:10,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 12:38:10,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:10,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 12:38:10,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-08 12:38:10,281 INFO L87 Difference]: Start difference. First operand 759 states and 1212 transitions. Second operand has 17 states, 16 states have (on average 6.875) internal successors, (110), 17 states have internal predecessors, (110), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) [2025-03-08 12:38:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:11,502 INFO L93 Difference]: Finished difference Result 2550 states and 4005 transitions. [2025-03-08 12:38:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 12:38:11,503 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 17 states have internal predecessors, (110), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) Word has length 212 [2025-03-08 12:38:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:11,514 INFO L225 Difference]: With dead ends: 2550 [2025-03-08 12:38:11,516 INFO L226 Difference]: Without dead ends: 1794 [2025-03-08 12:38:11,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 12:38:11,523 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 866 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:11,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 946 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:38:11,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2025-03-08 12:38:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1423. [2025-03-08 12:38:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1016 states have (on average 1.4586614173228347) internal successors, (1482), 1026 states have internal predecessors, (1482), 384 states have call successors, (384), 22 states have call predecessors, (384), 22 states have return successors, (384), 374 states have call predecessors, (384), 384 states have call successors, (384) [2025-03-08 12:38:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2250 transitions. [2025-03-08 12:38:11,702 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2250 transitions. Word has length 212 [2025-03-08 12:38:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:11,702 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 2250 transitions. [2025-03-08 12:38:11,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.875) internal successors, (110), 17 states have internal predecessors, (110), 7 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 7 states have call predecessors, (99), 7 states have call successors, (99) [2025-03-08 12:38:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2250 transitions. [2025-03-08 12:38:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 12:38:11,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:11,705 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:11,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:38:11,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 12:38:11,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:11,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:11,911 INFO L85 PathProgramCache]: Analyzing trace with hash 615843779, now seen corresponding path program 1 times [2025-03-08 12:38:11,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:11,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961039933] [2025-03-08 12:38:11,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:11,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 12:38:11,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 12:38:11,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:11,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:12,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961039933] [2025-03-08 12:38:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961039933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:12,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:12,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:38:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448138338] [2025-03-08 12:38:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:12,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:38:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:12,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:38:12,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:38:12,373 INFO L87 Difference]: Start difference. First operand 1423 states and 2250 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:13,123 INFO L93 Difference]: Finished difference Result 3033 states and 4747 transitions. [2025-03-08 12:38:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:38:13,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-03-08 12:38:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:13,133 INFO L225 Difference]: With dead ends: 3033 [2025-03-08 12:38:13,134 INFO L226 Difference]: Without dead ends: 1613 [2025-03-08 12:38:13,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:38:13,138 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 470 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:13,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 766 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:38:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2025-03-08 12:38:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1121. [2025-03-08 12:38:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 793 states have (on average 1.4476670870113493) internal successors, (1148), 800 states have internal predecessors, (1148), 308 states have call successors, (308), 19 states have call predecessors, (308), 19 states have return successors, (308), 301 states have call predecessors, (308), 308 states have call successors, (308) [2025-03-08 12:38:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1764 transitions. [2025-03-08 12:38:13,269 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1764 transitions. Word has length 212 [2025-03-08 12:38:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:13,270 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1764 transitions. [2025-03-08 12:38:13,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1764 transitions. [2025-03-08 12:38:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 12:38:13,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:13,272 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:13,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:38:13,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:13,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1969153476, now seen corresponding path program 1 times [2025-03-08 12:38:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:13,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633568438] [2025-03-08 12:38:13,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:13,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:13,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 12:38:13,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 12:38:13,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:13,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:13,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:38:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633568438] [2025-03-08 12:38:13,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633568438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:13,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:13,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:38:13,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649949278] [2025-03-08 12:38:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:13,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:38:13,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:38:13,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:38:13,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:38:13,675 INFO L87 Difference]: Start difference. First operand 1121 states and 1764 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:14,093 INFO L93 Difference]: Finished difference Result 2482 states and 3872 transitions. [2025-03-08 12:38:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:38:14,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-03-08 12:38:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:14,101 INFO L225 Difference]: With dead ends: 2482 [2025-03-08 12:38:14,101 INFO L226 Difference]: Without dead ends: 1400 [2025-03-08 12:38:14,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-03-08 12:38:14,105 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 312 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:14,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 644 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:38:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-03-08 12:38:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1142. [2025-03-08 12:38:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 778 states have (on average 1.4023136246786632) internal successors, (1091), 786 states have internal predecessors, (1091), 341 states have call successors, (341), 22 states have call predecessors, (341), 22 states have return successors, (341), 333 states have call predecessors, (341), 341 states have call successors, (341) [2025-03-08 12:38:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1773 transitions. [2025-03-08 12:38:14,222 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1773 transitions. Word has length 212 [2025-03-08 12:38:14,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:14,223 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1773 transitions. [2025-03-08 12:38:14,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1773 transitions. [2025-03-08 12:38:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 12:38:14,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:14,226 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:14,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 12:38:14,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:14,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash 89664742, now seen corresponding path program 1 times [2025-03-08 12:38:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:38:14,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852140443] [2025-03-08 12:38:14,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:38:14,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 12:38:14,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 12:38:14,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:14,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 12:38:14,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696575566] [2025-03-08 12:38:14,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:38:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:38:14,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:38:14,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:38:14,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 12:38:14,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 12:38:14,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:14,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:38:14,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:38:14,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 12:38:14,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 12:38:14,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:14,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:38:14,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:38:14,573 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:38:14,573 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:38:14,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:38:14,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:38:14,778 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:38:14,919 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:38:14,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:38:14 BoogieIcfgContainer [2025-03-08 12:38:14,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:38:14,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:38:14,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:38:14,924 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:38:14,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:02" (3/4) ... [2025-03-08 12:38:14,926 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:38:14,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:38:14,928 INFO L158 Benchmark]: Toolchain (without parser) took 12944.08ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 130.3MB in the beginning and 379.7MB in the end (delta: -249.4MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2025-03-08 12:38:14,928 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:38:14,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.39ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 114.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:38:14,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.04ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 111.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:38:14,928 INFO L158 Benchmark]: Boogie Preprocessor took 39.11ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 108.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:38:14,929 INFO L158 Benchmark]: IcfgBuilder took 495.48ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 81.1MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:38:14,930 INFO L158 Benchmark]: TraceAbstraction took 12058.92ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 80.6MB in the beginning and 379.8MB in the end (delta: -299.2MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. [2025-03-08 12:38:14,930 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 453.0MB. Free memory was 379.8MB in the beginning and 379.7MB in the end (delta: 120.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:38:14,931 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.39ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.39ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 114.6MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.04ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 111.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.11ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 108.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 495.48ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 81.1MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12058.92ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 80.6MB in the beginning and 379.8MB in the end (delta: -299.2MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 453.0MB. Free memory was 379.8MB in the beginning and 379.7MB in the end (delta: 120.0kB). 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 shiftRight at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 194, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 25; [L43] unsigned char var_1_33 = 128; [L44] double var_1_34 = 499.6; [L45] double var_1_35 = 3.5; [L46] unsigned char var_1_36 = 200; [L47] unsigned short int var_1_37 = 2; [L48] unsigned short int var_1_41 = 36532; [L49] unsigned short int var_1_42 = 32367; [L50] signed char var_1_43 = -2; [L51] signed char var_1_44 = 1; [L52] unsigned short int last_1_var_1_8 = 4; [L53] signed short int last_1_var_1_21 = -64; [L54] signed char last_1_var_1_25 = -128; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L198] isInitial = 1 [L199] FCALL initially() [L200] COND TRUE 1 [L201] CALL updateLastVariables() [L189] last_1_var_1_8 = var_1_8 [L190] last_1_var_1_21 = var_1_21 [L191] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L201] RET updateLastVariables() [L202] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] var_1_6 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L140] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L141] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L141] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L142] var_1_11 = __VERIFIER_nondet_long() [L143] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L145] var_1_12 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L146] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L148] var_1_13 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L149] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L151] var_1_15 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L152] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] var_1_16 = __VERIFIER_nondet_long() [L156] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L156] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L159] var_1_17 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L160] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L161] var_1_18 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L163] var_1_19 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L164] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] var_1_20 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_20 >= 0.0F && 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_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L166] RET assume_abort_if_not((var_1_20 >= 0.0F && 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_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L167] var_1_26 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L173] var_1_32 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L174] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L175] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L175] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L176] var_1_35 = __VERIFIER_nondet_double() [L177] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L177] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L178] var_1_41 = __VERIFIER_nondet_ushort() [L179] CALL assume_abort_if_not(var_1_41 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L179] RET assume_abort_if_not(var_1_41 >= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L180] CALL assume_abort_if_not(var_1_41 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L180] RET assume_abort_if_not(var_1_41 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L181] var_1_42 = __VERIFIER_nondet_ushort() [L182] CALL assume_abort_if_not(var_1_42 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L182] RET assume_abort_if_not(var_1_42 >= 16383) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L183] CALL assume_abort_if_not(var_1_42 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L183] RET assume_abort_if_not(var_1_42 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L184] var_1_44 = __VERIFIER_nondet_char() [L185] CALL assume_abort_if_not(var_1_44 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L185] RET assume_abort_if_not(var_1_44 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L186] CALL assume_abort_if_not(var_1_44 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L186] RET assume_abort_if_not(var_1_44 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L202] RET updateVariables() [L203] CALL step() [L58] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L58] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L59] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L63] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L64] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L65] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L70] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L72] COND FALSE !(var_1_14 >= var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L77] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L78] COND TRUE \read(var_1_4) [L79] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L82] COND TRUE var_1_14 >= ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))) [L83] var_1_33 = ((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L85] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L86] COND FALSE !(var_1_42 > var_1_41) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L93] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L100] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L102] COND TRUE (- var_1_14) <= var_1_14 [L103] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L111] COND FALSE !(var_1_14 >= (((((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14))) < 0 ) ? -((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14))) : ((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14)))))) [L118] var_1_27 = var_1_32 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L120] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L121] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L123] EXPR ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) | (-10 * var_1_25) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L123] COND FALSE !(-2 > (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) | (-10 * var_1_25))) [L126] COND FALSE !(((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) <= ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) [L131] var_1_37 = (var_1_41 - (var_1_42 - var_1_32)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L203] RET step() [L204] CALL, EXPR property() [L194] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L194-L195] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=-65279, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=-65279] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 193 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 12, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3554 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3524 mSDsluCounter, 7203 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4795 mSDsCounter, 1481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2567 IncrementalHoareTripleChecker+Invalid, 4048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1481 mSolverCounterUnsat, 2408 mSDtfsCounter, 2567 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 760 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1423occurred in iteration=9, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 2197 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3165 NumberOfCodeBlocks, 3165 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2937 ConstructedInterpolants, 0 QuantifiedInterpolants, 9457 SizeOfPredicates, 2 NumberOfNonLiveVariables, 955 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 29324/29568 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-03-08 12:38:14,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 8eb615b84715d4e5603f49b8da12039ac524d65195b0f458b0aca18ed675dad9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:38:16,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:38:16,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:38:16,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:38:16,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:38:16,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:38:16,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:38:16,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:38:16,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:38:16,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:38:16,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:38:16,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:38:16,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:38:16,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:38:16,915 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:38:16,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:38:16,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:38:16,915 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:38:16,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:38:16,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:38:16,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:38:16,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:38:16,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:38:16,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:38:16,916 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:38:16,916 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:38:16,916 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:38:16,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:38:16,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:38:16,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:38:16,917 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:38:16,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:38:16,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:38:16,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:38:16,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:38:16,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:38:16,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:38:16,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:38:16,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:38:16,918 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:38:16,918 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:38:16,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:38:16,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:38:16,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:38:16,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:38:16,918 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/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 -> 8eb615b84715d4e5603f49b8da12039ac524d65195b0f458b0aca18ed675dad9 [2025-03-08 12:38:17,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:38:17,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:38:17,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:38:17,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:38:17,172 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:38:17,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-03-08 12:38:18,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4195290/25c241912170429a8b90d5cbd9646bc9/FLAGad4093254 [2025-03-08 12:38:18,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:38:18,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-03-08 12:38:18,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4195290/25c241912170429a8b90d5cbd9646bc9/FLAGad4093254 [2025-03-08 12:38:18,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4195290/25c241912170429a8b90d5cbd9646bc9 [2025-03-08 12:38:18,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:38:18,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:38:18,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:38:18,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:38:18,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:38:18,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:18" (1/1) ... [2025-03-08 12:38:18,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d45283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:18, skipping insertion in model container [2025-03-08 12:38:18,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:38:18" (1/1) ... [2025-03-08 12:38:18,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:38:19,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i[919,932] [2025-03-08 12:38:19,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:38:19,146 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:38:19,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i[919,932] [2025-03-08 12:38:19,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:38:19,217 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:38:19,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19 WrapperNode [2025-03-08 12:38:19,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:38:19,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:38:19,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:38:19,219 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:38:19,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,261 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2025-03-08 12:38:19,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:38:19,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:38:19,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:38:19,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:38:19,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,293 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-03-08 12:38:19,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:38:19,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:38:19,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:38:19,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:38:19,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (1/1) ... [2025-03-08 12:38:19,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:38:19,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:38:19,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:38:19,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:38:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:38:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:38:19,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:38:19,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:38:19,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:38:19,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:38:19,455 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:38:19,456 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:38:26,219 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 12:38:26,219 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:38:26,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:38:26,228 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:38:26,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:26 BoogieIcfgContainer [2025-03-08 12:38:26,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:38:26,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:38:26,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:38:26,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:38:26,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:38:18" (1/3) ... [2025-03-08 12:38:26,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df80699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:26, skipping insertion in model container [2025-03-08 12:38:26,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:38:19" (2/3) ... [2025-03-08 12:38:26,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df80699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:26, skipping insertion in model container [2025-03-08 12:38:26,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:26" (3/3) ... [2025-03-08 12:38:26,236 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-03-08 12:38:26,246 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:38:26,247 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:38:26,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:38:26,295 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;@443cf2ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:38:26,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:38:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 12:38:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 12:38:26,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:26,307 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:26,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:26,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1116519265, now seen corresponding path program 1 times [2025-03-08 12:38:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:38:26,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838956451] [2025-03-08 12:38:26,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:26,320 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-03-08 12:38:26,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:38:26,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-08 12:38:26,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 12:38:26,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 12:38:26,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 12:38:26,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:26,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:26,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:38:26,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:38:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:26,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:38:26,881 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:38:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838956451] [2025-03-08 12:38:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838956451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:26,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:38:26,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55308030] [2025-03-08 12:38:26,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:26,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:38:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:38:26,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:38:26,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:38:26,903 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:26,921 INFO L93 Difference]: Finished difference Result 176 states and 318 transitions. [2025-03-08 12:38:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:38:26,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-08 12:38:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:26,932 INFO L225 Difference]: With dead ends: 176 [2025-03-08 12:38:26,935 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 12:38:26,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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-03-08 12:38:26,940 INFO L435 NwaCegarLoop]: 138 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, 138 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-03-08 12:38:26,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:38:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 12:38:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-08 12:38:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 12:38:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2025-03-08 12:38:26,980 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 205 [2025-03-08 12:38:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:26,983 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2025-03-08 12:38:26,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2025-03-08 12:38:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 12:38:26,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:26,986 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:27,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 12:38:27,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-08 12:38:27,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:27,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1825138334, now seen corresponding path program 1 times [2025-03-08 12:38:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:38:27,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073139803] [2025-03-08 12:38:27,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:27,188 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-03-08 12:38:27,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:38:27,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-08 12:38:27,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-08 12:38:27,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 12:38:27,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 12:38:27,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:27,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:27,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:38:27,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:38:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:29,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:38:29,784 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:38:29,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073139803] [2025-03-08 12:38:29,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073139803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:29,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:29,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:38:29,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123166543] [2025-03-08 12:38:29,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:29,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:38:29,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:38:29,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:38:29,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:38:29,787 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:31,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:38:36,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-08 12:38:36,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:36,368 INFO L93 Difference]: Finished difference Result 244 states and 386 transitions. [2025-03-08 12:38:36,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:38:36,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-08 12:38:36,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:36,371 INFO L225 Difference]: With dead ends: 244 [2025-03-08 12:38:36,372 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 12:38:36,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:38:36,373 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 16 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:36,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 253 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2025-03-08 12:38:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 12:38:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2025-03-08 12:38:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 85 states have internal predecessors, (108), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 12:38:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 240 transitions. [2025-03-08 12:38:36,406 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 240 transitions. Word has length 205 [2025-03-08 12:38:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:36,406 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 240 transitions. [2025-03-08 12:38:36,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 240 transitions. [2025-03-08 12:38:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 12:38:36,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:36,408 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:36,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:38:36,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-08 12:38:36,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:36,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1867736707, now seen corresponding path program 1 times [2025-03-08 12:38:36,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:38:36,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528471223] [2025-03-08 12:38:36,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:36,613 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-03-08 12:38:36,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:38:36,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-08 12:38:36,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:38:36,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 12:38:37,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 12:38:37,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:37,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:37,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:38:37,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:38:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 12:38:39,148 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:38:39,148 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:38:39,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528471223] [2025-03-08 12:38:39,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528471223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:39,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:39,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:38:39,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343256679] [2025-03-08 12:38:39,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:39,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:38:39,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:38:39,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:38:39,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:38:39,149 INFO L87 Difference]: Start difference. First operand 154 states and 240 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:43,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:38:47,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:38:52,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:38:55,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:38:55,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:55,417 INFO L93 Difference]: Finished difference Result 404 states and 635 transitions. [2025-03-08 12:38:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:38:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-08 12:38:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:55,425 INFO L225 Difference]: With dead ends: 404 [2025-03-08 12:38:55,425 INFO L226 Difference]: Without dead ends: 318 [2025-03-08 12:38:55,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:38:55,428 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 242 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 68 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:55,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 718 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2025-03-08 12:38:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-08 12:38:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 238. [2025-03-08 12:38:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 135 states have (on average 1.288888888888889) internal successors, (174), 135 states have internal predecessors, (174), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 12:38:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 372 transitions. [2025-03-08 12:38:55,482 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 372 transitions. Word has length 206 [2025-03-08 12:38:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:55,483 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 372 transitions. [2025-03-08 12:38:55,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 12:38:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 372 transitions. [2025-03-08 12:38:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 12:38:55,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:55,488 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 12:38:55,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:38:55,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-08 12:38:55,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:55,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash -7784605, now seen corresponding path program 1 times [2025-03-08 12:38:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:38:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794206868] [2025-03-08 12:38:55,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:55,690 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-03-08 12:38:55,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:38:55,692 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-08 12:38:55,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 12:38:55,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 12:38:56,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 12:38:56,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:56,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:56,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 12:38:56,104 INFO L279 TraceCheckSpWp]: Computing forward predicates...