./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-ci_file-53.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 f94ee9d74ce660c6f227b9660cf3df0f0129c7656532a2fab777870f108cf683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:05:14,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:05:14,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:05:14,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:05:14,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:05:15,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:05:15,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:05:15,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:05:15,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:05:15,015 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:05:15,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:05:15,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:05:15,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:05:15,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:05:15,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:05:15,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:05:15,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:05:15,017 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 -> f94ee9d74ce660c6f227b9660cf3df0f0129c7656532a2fab777870f108cf683 [2025-03-03 21:05:15,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:05:15,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:05:15,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:05:15,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:05:15,240 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:05:15,240 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-ci_file-53.i [2025-03-03 21:05:16,379 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7208c33c2/0be807ef611347148a7e1d7e379a9a5c/FLAGf36e32b60 [2025-03-03 21:05:16,669 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:05:16,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-53.i [2025-03-03 21:05:16,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7208c33c2/0be807ef611347148a7e1d7e379a9a5c/FLAGf36e32b60 [2025-03-03 21:05:16,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7208c33c2/0be807ef611347148a7e1d7e379a9a5c [2025-03-03 21:05:16,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:05:16,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:05:16,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:05:16,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:05:16,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:05:16,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:05:16" (1/1) ... [2025-03-03 21:05:16,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ea8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:16, skipping insertion in model container [2025-03-03 21:05:16,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:05:16" (1/1) ... [2025-03-03 21:05:16,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:05:17,106 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-ci_file-53.i[919,932] [2025-03-03 21:05:17,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:05:17,174 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:05:17,183 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-ci_file-53.i[919,932] [2025-03-03 21:05:17,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:05:17,243 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:05:17,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17 WrapperNode [2025-03-03 21:05:17,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:05:17,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:05:17,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:05:17,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:05:17,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,298 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2025-03-03 21:05:17,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:05:17,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:05:17,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:05:17,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:05:17,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,335 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-03 21:05:17,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,351 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:05:17,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:05:17,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:05:17,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:05:17,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (1/1) ... [2025-03-03 21:05:17,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:05:17,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:05:17,382 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-03 21:05:17,386 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-03 21:05:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:05:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:05:17,405 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:05:17,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:05:17,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:05:17,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:05:17,474 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:05:17,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:05:17,873 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short21#1;havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-03 21:05:17,897 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-03 21:05:17,898 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:05:17,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:05:17,916 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 21:05:17,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:05:17 BoogieIcfgContainer [2025-03-03 21:05:17,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:05:17,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:05:17,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:05:17,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:05:17,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:05:16" (1/3) ... [2025-03-03 21:05:17,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d49d254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:05:17, skipping insertion in model container [2025-03-03 21:05:17,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:17" (2/3) ... [2025-03-03 21:05:17,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d49d254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:05:17, skipping insertion in model container [2025-03-03 21:05:17,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:05:17" (3/3) ... [2025-03-03 21:05:17,924 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-53.i [2025-03-03 21:05:17,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:05:17,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-53.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:05:17,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:05:17,998 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;@59baaf7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:05:17,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:05:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 73 states have internal predecessors, (106), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:05:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:05:18,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:18,013 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:18,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:18,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1921266011, now seen corresponding path program 1 times [2025-03-03 21:05:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:05:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698590296] [2025-03-03 21:05:18,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:05:18,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:05:18,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:05:18,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:18,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 21:05:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:05:18,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698590296] [2025-03-03 21:05:18,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698590296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:05:18,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136744356] [2025-03-03 21:05:18,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:18,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:05:18,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:05:18,331 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-03 21:05:18,333 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-03 21:05:18,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:05:18,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:05:18,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:18,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:18,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:05:18,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:05:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 21:05:18,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:05:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136744356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:05:18,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:05:18,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:05:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530430341] [2025-03-03 21:05:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:05:18,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:05:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:05:18,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:05:18,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:05:18,533 INFO L87 Difference]: Start difference. First operand has 98 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 73 states have internal predecessors, (106), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:05:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:18,564 INFO L93 Difference]: Finished difference Result 190 states and 322 transitions. [2025-03-03 21:05:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:05:18,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 160 [2025-03-03 21:05:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:18,573 INFO L225 Difference]: With dead ends: 190 [2025-03-03 21:05:18,573 INFO L226 Difference]: Without dead ends: 95 [2025-03-03 21:05:18,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-03 21:05:18,580 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:18,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:05:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-03 21:05:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-03 21:05:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:05:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2025-03-03 21:05:18,621 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 160 [2025-03-03 21:05:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:18,621 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2025-03-03 21:05:18,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:05:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2025-03-03 21:05:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:05:18,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:18,627 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:18,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:05:18,827 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-03 21:05:18,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:18,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 679078658, now seen corresponding path program 1 times [2025-03-03 21:05:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:05:18,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478757858] [2025-03-03 21:05:18,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:05:18,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:05:18,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:05:18,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:18,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:05:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:05:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478757858] [2025-03-03 21:05:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478757858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:05:19,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:05:19,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:05:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080119981] [2025-03-03 21:05:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:05:19,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:05:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:05:19,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:05:19,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:05:19,061 INFO L87 Difference]: Start difference. First operand 95 states and 147 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:19,155 INFO L93 Difference]: Finished difference Result 268 states and 416 transitions. [2025-03-03 21:05:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:05:19,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2025-03-03 21:05:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:19,158 INFO L225 Difference]: With dead ends: 268 [2025-03-03 21:05:19,158 INFO L226 Difference]: Without dead ends: 176 [2025-03-03 21:05:19,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:05:19,161 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 127 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:19,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 250 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:05:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-03 21:05:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2025-03-03 21:05:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 125 states have (on average 1.4) internal successors, (175), 125 states have internal predecessors, (175), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:05:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 267 transitions. [2025-03-03 21:05:19,192 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 267 transitions. Word has length 160 [2025-03-03 21:05:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:19,192 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 267 transitions. [2025-03-03 21:05:19,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 267 transitions. [2025-03-03 21:05:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 21:05:19,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:19,194 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:19,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:05:19,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:19,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:19,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1323678583, now seen corresponding path program 1 times [2025-03-03 21:05:19,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:05:19,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014989321] [2025-03-03 21:05:19,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:19,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:05:19,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 21:05:19,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 21:05:19,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:19,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:05:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:05:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014989321] [2025-03-03 21:05:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014989321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:05:19,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:05:19,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:05:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449347128] [2025-03-03 21:05:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:05:19,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:05:19,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:05:19,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:05:19,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:05:19,388 INFO L87 Difference]: Start difference. First operand 174 states and 267 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:19,517 INFO L93 Difference]: Finished difference Result 454 states and 700 transitions. [2025-03-03 21:05:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:05:19,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-03-03 21:05:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:19,521 INFO L225 Difference]: With dead ends: 454 [2025-03-03 21:05:19,521 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 21:05:19,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:05:19,526 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 136 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:19,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 367 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:05:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 21:05:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 177. [2025-03-03 21:05:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 128 states have (on average 1.3984375) internal successors, (179), 128 states have internal predecessors, (179), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:05:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 271 transitions. [2025-03-03 21:05:19,556 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 271 transitions. Word has length 162 [2025-03-03 21:05:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:19,556 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 271 transitions. [2025-03-03 21:05:19,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 271 transitions. [2025-03-03 21:05:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 21:05:19,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:19,563 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:19,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:05:19,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1617081590, now seen corresponding path program 1 times [2025-03-03 21:05:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:05:19,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122524120] [2025-03-03 21:05:19,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:05:19,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 21:05:19,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 21:05:19,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:19,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:05:19,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:05:19,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122524120] [2025-03-03 21:05:19,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122524120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:05:19,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:05:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:05:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788350064] [2025-03-03 21:05:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:05:19,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:05:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:05:19,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:05:19,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:05:19,825 INFO L87 Difference]: Start difference. First operand 177 states and 271 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:20,046 INFO L93 Difference]: Finished difference Result 605 states and 929 transitions. [2025-03-03 21:05:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:05:20,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2025-03-03 21:05:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:20,052 INFO L225 Difference]: With dead ends: 605 [2025-03-03 21:05:20,052 INFO L226 Difference]: Without dead ends: 431 [2025-03-03 21:05:20,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 21:05:20,054 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 176 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:20,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 431 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 21:05:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-03 21:05:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 413. [2025-03-03 21:05:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 316 states have (on average 1.4335443037974684) internal successors, (453), 316 states have internal predecessors, (453), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 21:05:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 637 transitions. [2025-03-03 21:05:20,100 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 637 transitions. Word has length 162 [2025-03-03 21:05:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:20,100 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 637 transitions. [2025-03-03 21:05:20,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 637 transitions. [2025-03-03 21:05:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 21:05:20,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:20,103 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:20,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:05:20,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash -409391805, now seen corresponding path program 1 times [2025-03-03 21:05:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:05:20,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209534860] [2025-03-03 21:05:20,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:05:20,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 21:05:20,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 21:05:20,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:20,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:05:20,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:05:20,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209534860] [2025-03-03 21:05:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209534860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:05:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894269898] [2025-03-03 21:05:20,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:20,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:05:20,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:05:20,555 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-03 21:05:20,557 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-03 21:05:20,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 21:05:20,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 21:05:20,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:20,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:20,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 21:05:20,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:05:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-03 21:05:21,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:05:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:05:21,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894269898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:05:21,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:05:21,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 20 [2025-03-03 21:05:21,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704264274] [2025-03-03 21:05:21,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:05:21,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 21:05:21,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:05:21,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 21:05:21,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-03 21:05:21,444 INFO L87 Difference]: Start difference. First operand 413 states and 637 transitions. Second operand has 20 states, 20 states have (on average 5.15) internal successors, (103), 20 states have internal predecessors, (103), 5 states have call successors, (53), 3 states have call predecessors, (53), 6 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) [2025-03-03 21:05:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:23,471 INFO L93 Difference]: Finished difference Result 1224 states and 1843 transitions. [2025-03-03 21:05:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 21:05:23,473 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 20 states have internal predecessors, (103), 5 states have call successors, (53), 3 states have call predecessors, (53), 6 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) Word has length 163 [2025-03-03 21:05:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:23,480 INFO L225 Difference]: With dead ends: 1224 [2025-03-03 21:05:23,480 INFO L226 Difference]: Without dead ends: 814 [2025-03-03 21:05:23,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=739, Invalid=2683, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 21:05:23,486 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 996 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 2660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:23,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 2716 Invalid, 2660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:05:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-03-03 21:05:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 420. [2025-03-03 21:05:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 319 states have (on average 1.4106583072100314) internal successors, (450), 319 states have internal predecessors, (450), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 21:05:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 634 transitions. [2025-03-03 21:05:23,561 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 634 transitions. Word has length 163 [2025-03-03 21:05:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:23,562 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 634 transitions. [2025-03-03 21:05:23,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 20 states have internal predecessors, (103), 5 states have call successors, (53), 3 states have call predecessors, (53), 6 states have return successors, (54), 5 states have call predecessors, (54), 5 states have call successors, (54) [2025-03-03 21:05:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 634 transitions. [2025-03-03 21:05:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 21:05:23,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:23,565 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:23,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 21:05:23,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:05:23,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:23,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash 18627464, now seen corresponding path program 1 times [2025-03-03 21:05:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:05:23,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453008940] [2025-03-03 21:05:23,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:05:23,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 21:05:23,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 21:05:23,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:23,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:05:23,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:05:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453008940] [2025-03-03 21:05:23,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453008940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:05:23,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:05:23,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:05:23,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779767191] [2025-03-03 21:05:23,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:05:23,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:05:23,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:05:23,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:05:23,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:05:23,856 INFO L87 Difference]: Start difference. First operand 420 states and 634 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:23,908 INFO L93 Difference]: Finished difference Result 856 states and 1292 transitions. [2025-03-03 21:05:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:05:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2025-03-03 21:05:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:23,911 INFO L225 Difference]: With dead ends: 856 [2025-03-03 21:05:23,911 INFO L226 Difference]: Without dead ends: 439 [2025-03-03 21:05:23,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:05:23,916 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 111 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:23,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 371 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:05:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-03 21:05:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2025-03-03 21:05:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 336 states have (on average 1.3720238095238095) internal successors, (461), 336 states have internal predecessors, (461), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 21:05:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 645 transitions. [2025-03-03 21:05:23,959 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 645 transitions. Word has length 164 [2025-03-03 21:05:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:23,960 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 645 transitions. [2025-03-03 21:05:23,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 645 transitions. [2025-03-03 21:05:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 21:05:23,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:23,961 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:23,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:05:23,962 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:23,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash -161077807, now seen corresponding path program 1 times [2025-03-03 21:05:23,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:05:23,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086580520] [2025-03-03 21:05:23,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:23,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:05:23,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 21:05:23,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 21:05:23,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:23,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:05:24,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:05:24,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086580520] [2025-03-03 21:05:24,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086580520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:05:24,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:05:24,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 21:05:24,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242919993] [2025-03-03 21:05:24,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:05:24,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:05:24,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:05:24,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:05:24,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:05:24,153 INFO L87 Difference]: Start difference. First operand 437 states and 645 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:24,763 INFO L93 Difference]: Finished difference Result 1340 states and 1945 transitions. [2025-03-03 21:05:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 21:05:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 164 [2025-03-03 21:05:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:24,768 INFO L225 Difference]: With dead ends: 1340 [2025-03-03 21:05:24,769 INFO L226 Difference]: Without dead ends: 906 [2025-03-03 21:05:24,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:05:24,771 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 273 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:24,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 498 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 21:05:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-03 21:05:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 894. [2025-03-03 21:05:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 707 states have (on average 1.3422913719943423) internal successors, (949), 713 states have internal predecessors, (949), 168 states have call successors, (168), 18 states have call predecessors, (168), 18 states have return successors, (168), 162 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-03 21:05:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1285 transitions. [2025-03-03 21:05:24,866 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1285 transitions. Word has length 164 [2025-03-03 21:05:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:24,867 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1285 transitions. [2025-03-03 21:05:24,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1285 transitions. [2025-03-03 21:05:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 21:05:24,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:24,868 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:05:24,869 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash -357591312, now seen corresponding path program 1 times [2025-03-03 21:05:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:05:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052521164] [2025-03-03 21:05:24,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:05:24,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 21:05:24,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 21:05:24,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:05:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53423368] [2025-03-03 21:05:24,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:24,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:05:24,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:05:24,938 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-03 21:05:24,940 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-03 21:05:25,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 21:05:25,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 21:05:25,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:25,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:05:25,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:05:25,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 21:05:25,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 21:05:25,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:25,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:05:25,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:05:25,434 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:05:25,435 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:05:25,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 21:05:25,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:05:25,639 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:25,739 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:05:25,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:05:25 BoogieIcfgContainer [2025-03-03 21:05:25,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:05:25,742 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:05:25,743 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:05:25,743 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:05:25,743 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:05:17" (3/4) ... [2025-03-03 21:05:25,745 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:05:25,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:05:25,746 INFO L158 Benchmark]: Toolchain (without parser) took 8772.17ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 112.8MB in the beginning and 179.1MB in the end (delta: -66.4MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2025-03-03 21:05:25,746 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:05:25,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.84ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 96.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:05:25,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.17ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.6MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:05:25,747 INFO L158 Benchmark]: Boogie Preprocessor took 55.31ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 88.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:05:25,747 INFO L158 Benchmark]: IcfgBuilder took 561.92ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 58.2MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:05:25,747 INFO L158 Benchmark]: TraceAbstraction took 7824.35ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 57.5MB in the beginning and 179.2MB in the end (delta: -121.7MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2025-03-03 21:05:25,747 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 226.5MB. Free memory was 179.2MB in the beginning and 179.1MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:05:25,752 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.84ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 96.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.17ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.6MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.31ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 88.1MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 561.92ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 58.2MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7824.35ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 57.5MB in the beginning and 179.2MB in the end (delta: -121.7MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 226.5MB. Free memory was 179.2MB in the beginning and 179.1MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 171, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryArithmeticFLOAToperation at line 73, overapproximation of someBinaryArithmeticFLOAToperation at line 128, overapproximation of someUnaryFLOAToperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] unsigned short int var_1_31 = 8; [L41] unsigned char var_1_33 = 1; [L42] float var_1_35 = 32.4; [L43] float var_1_36 = 8.5; [L44] float var_1_37 = 7.5; [L45] unsigned char var_1_39 = 16; [L46] signed short int var_1_41 = -2; [L47] unsigned char var_1_42 = 10; [L48] unsigned char var_1_43 = 4; [L49] unsigned char var_1_44 = 64; [L50] signed long int var_1_45 = -25; [L51] unsigned char last_1_var_1_1 = 0; [L52] unsigned long int last_1_var_1_9 = 10; [L53] signed short int last_1_var_1_14 = 32; [L54] unsigned char last_1_var_1_16 = 1; [L55] signed char last_1_var_1_20 = 1; VAL [isInitial=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L180] last_1_var_1_1 = var_1_1 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_14 = var_1_14 [L183] last_1_var_1_16 = var_1_16 [L184] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L142] var_1_8 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L143] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L144] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L145] var_1_11 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L146] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L147] var_1_12 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L149] var_1_13 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L151] var_1_15 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L153] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L153] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L154] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L154] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L155] var_1_17 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L159] var_1_18 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] var_1_19 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L163] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L164] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L164] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] var_1_21 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L166] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L167] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] var_1_36 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L169] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_37=15/2, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L170] var_1_37 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L172] var_1_43 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L173] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] CALL assume_abort_if_not(var_1_43 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] RET assume_abort_if_not(var_1_43 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] var_1_44 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L176] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L177] CALL assume_abort_if_not(var_1_44 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L177] RET assume_abort_if_not(var_1_44 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L195] RET updateVariables() [L196] CALL step() [L59] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L60] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L61] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L66] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L67] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L67] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L68] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L70] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L71] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L72] COND TRUE (! var_1_1) || stepLocal_4 [L73] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L81] COND FALSE !(\read(var_1_1)) [L88] var_1_24 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L90] var_1_20 = var_1_21 [L91] var_1_22 = var_1_12 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L92] COND FALSE !(var_1_9 >= var_1_23) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L99] COND TRUE \read(var_1_8) [L100] var_1_41 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=100, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L104] var_1_23 = var_1_21 [L105] var_1_33 = var_1_8 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=16, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L106] COND TRUE var_1_8 || var_1_8 [L107] var_1_39 = var_1_18 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L109] COND TRUE (var_1_16 / var_1_15) >= var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L110] COND TRUE \read(var_1_8) [L111] var_1_45 = (((((var_1_16) < (var_1_43)) ? (var_1_16) : (var_1_43))) - var_1_44) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L118] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L121] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L121] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L122] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_35=162/5, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L127] COND TRUE var_1_15 >= var_1_21 [L128] var_1_35 = ((var_1_36 - var_1_37) + var_1_12) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L130] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L131] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L132] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L133] COND FALSE !(stepLocal_2 <= (-5 + var_1_16)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_39=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L137] COND TRUE var_1_12 <= ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L138] var_1_42 = (((((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) < 0 ) ? -((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) : ((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_39=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_39=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L187] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_39=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L187-L188] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_39=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=0, var_1_15=10, var_1_16=0, var_1_17=12, var_1_18=0, var_1_19=-256, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_33=1, var_1_39=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 8, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1821 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1819 mSDsluCounter, 4776 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3309 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2677 IncrementalHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 1467 mSDtfsCounter, 2677 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 492 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=894occurred in iteration=7, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 534 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1611 ConstructedInterpolants, 0 QuantifiedInterpolants, 2977 SizeOfPredicates, 5 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10013/10120 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-03 21:05:25,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-ci_file-53.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 f94ee9d74ce660c6f227b9660cf3df0f0129c7656532a2fab777870f108cf683 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:05:27,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:05:27,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:05:27,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:05:27,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:05:27,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:05:27,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:05:27,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:05:27,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:05:27,747 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:05:27,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:05:27,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:05:27,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:05:27,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:05:27,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:05:27,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:05:27,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:05:27,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:05:27,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:05:27,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:05:27,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:05:27,749 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:05:27,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:05:27,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:05:27,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:05:27,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:05:27,751 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 -> f94ee9d74ce660c6f227b9660cf3df0f0129c7656532a2fab777870f108cf683 [2025-03-03 21:05:27,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:05:28,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:05:28,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:05:28,006 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:05:28,006 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:05:28,007 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-ci_file-53.i [2025-03-03 21:05:29,163 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f18d9c6e/de64ba1ee1f54b49b32faf03aa64caa7/FLAG4c61910ea [2025-03-03 21:05:29,381 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:05:29,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-53.i [2025-03-03 21:05:29,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f18d9c6e/de64ba1ee1f54b49b32faf03aa64caa7/FLAG4c61910ea [2025-03-03 21:05:29,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f18d9c6e/de64ba1ee1f54b49b32faf03aa64caa7 [2025-03-03 21:05:29,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:05:29,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:05:29,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:05:29,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:05:29,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:05:29,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:29,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab0eb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29, skipping insertion in model container [2025-03-03 21:05:29,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:29,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:05:29,842 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-ci_file-53.i[919,932] [2025-03-03 21:05:29,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:05:29,906 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:05:29,913 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-ci_file-53.i[919,932] [2025-03-03 21:05:29,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:05:29,946 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:05:29,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29 WrapperNode [2025-03-03 21:05:29,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:05:29,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:05:29,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:05:29,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:05:29,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:29,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:29,985 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-03 21:05:29,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:05:29,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:05:29,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:05:29,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:05:29,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:29,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:30,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:30,021 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-03 21:05:30,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:30,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:30,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:30,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:30,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:30,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:30,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:05:30,050 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:05:30,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:05:30,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:05:30,053 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (1/1) ... [2025-03-03 21:05:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:05:30,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:05:30,083 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-03 21:05:30,086 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-03 21:05:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:05:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:05:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:05:30,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:05:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:05:30,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:05:30,175 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:05:30,177 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:05:31,246 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 21:05:31,246 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:05:31,252 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:05:31,253 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:05:31,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:05:31 BoogieIcfgContainer [2025-03-03 21:05:31,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:05:31,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:05:31,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:05:31,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:05:31,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:05:29" (1/3) ... [2025-03-03 21:05:31,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96f3e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:05:31, skipping insertion in model container [2025-03-03 21:05:31,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:05:29" (2/3) ... [2025-03-03 21:05:31,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96f3e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:05:31, skipping insertion in model container [2025-03-03 21:05:31,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:05:31" (3/3) ... [2025-03-03 21:05:31,260 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-53.i [2025-03-03 21:05:31,269 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:05:31,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-53.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:05:31,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:05:31,313 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;@3b471317, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:05:31,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:05:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:05:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:05:31,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:31,327 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:31,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:31,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash 320097595, now seen corresponding path program 1 times [2025-03-03 21:05:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:05:31,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357127922] [2025-03-03 21:05:31,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:31,339 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-03 21:05:31,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:05:31,342 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-03 21:05:31,343 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-03 21:05:31,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:05:31,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:05:31,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:31,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:31,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:05:31,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:05:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-03-03 21:05:31,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:05:31,693 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:05:31,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357127922] [2025-03-03 21:05:31,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357127922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:05:31,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:05:31,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:05:31,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61514569] [2025-03-03 21:05:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:05:31,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:05:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:05:31,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:05:31,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:05:31,716 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:05:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:31,733 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2025-03-03 21:05:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:05:31,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2025-03-03 21:05:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:31,738 INFO L225 Difference]: With dead ends: 154 [2025-03-03 21:05:31,738 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 21:05:31,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-03 21:05:31,742 INFO L435 NwaCegarLoop]: 120 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, 120 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-03 21:05:31,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:05:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 21:05:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 21:05:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:05:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2025-03-03 21:05:31,770 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 155 [2025-03-03 21:05:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:31,770 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2025-03-03 21:05:31,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:05:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2025-03-03 21:05:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:05:31,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:31,776 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:31,786 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-03 21:05:31,977 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-03 21:05:31,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:31,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash -144495938, now seen corresponding path program 1 times [2025-03-03 21:05:31,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:05:31,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17221214] [2025-03-03 21:05:31,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:31,978 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-03 21:05:31,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:05:31,982 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-03 21:05:31,982 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-03 21:05:32,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:05:32,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:05:32,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:32,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:32,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:05:32,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:05:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 22 proven. 66 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-03 21:05:32,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:05:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:05:32,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:05:32,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17221214] [2025-03-03 21:05:32,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17221214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:05:32,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:05:32,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 21:05:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063756962] [2025-03-03 21:05:32,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:05:32,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:05:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:05:32,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:05:32,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:05:32,777 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 21:05:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:33,221 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2025-03-03 21:05:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:05:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) Word has length 155 [2025-03-03 21:05:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:33,222 INFO L225 Difference]: With dead ends: 159 [2025-03-03 21:05:33,222 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 21:05:33,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:05:33,223 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 124 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:33,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 210 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:05:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 21:05:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-03-03 21:05:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:05:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 120 transitions. [2025-03-03 21:05:33,233 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 120 transitions. Word has length 155 [2025-03-03 21:05:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:33,233 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 120 transitions. [2025-03-03 21:05:33,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 1 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 21:05:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2025-03-03 21:05:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 21:05:33,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:33,235 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:33,244 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 (3)] Ended with exit code 0 [2025-03-03 21:05:33,435 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-03 21:05:33,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:33,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:33,436 INFO L85 PathProgramCache]: Analyzing trace with hash -273578657, now seen corresponding path program 1 times [2025-03-03 21:05:33,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:05:33,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060749263] [2025-03-03 21:05:33,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:33,437 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-03 21:05:33,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:05:33,439 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-03 21:05:33,440 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-03 21:05:33,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 21:05:33,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 21:05:33,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:33,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:33,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:05:33,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:05:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:05:33,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:05:33,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:05:33,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060749263] [2025-03-03 21:05:33,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060749263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:05:33,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:05:33,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:05:33,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607238699] [2025-03-03 21:05:33,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:05:33,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:05:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:05:33,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:05:33,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:05:33,712 INFO L87 Difference]: Start difference. First operand 81 states and 120 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:34,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:34,038 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2025-03-03 21:05:34,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:05:34,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2025-03-03 21:05:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:34,040 INFO L225 Difference]: With dead ends: 233 [2025-03-03 21:05:34,040 INFO L226 Difference]: Without dead ends: 155 [2025-03-03 21:05:34,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 153 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-03 21:05:34,041 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 98 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:34,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 209 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:05:34,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-03 21:05:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2025-03-03 21:05:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:05:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 225 transitions. [2025-03-03 21:05:34,058 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 225 transitions. Word has length 155 [2025-03-03 21:05:34,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:34,058 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 225 transitions. [2025-03-03 21:05:34,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 225 transitions. [2025-03-03 21:05:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 21:05:34,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:34,060 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:34,069 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 (4)] Ended with exit code 0 [2025-03-03 21:05:34,260 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-03 21:05:34,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:34,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1166504450, now seen corresponding path program 1 times [2025-03-03 21:05:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:05:34,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756824135] [2025-03-03 21:05:34,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:34,261 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-03 21:05:34,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:05:34,263 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-03 21:05:34,265 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-03 21:05:34,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:05:34,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:05:34,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:34,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:34,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:05:34,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:05:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:05:34,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:05:34,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:05:34,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756824135] [2025-03-03 21:05:34,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756824135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:05:34,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:05:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:05:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258907126] [2025-03-03 21:05:34,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:05:34,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:05:34,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:05:34,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:05:34,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:05:34,517 INFO L87 Difference]: Start difference. First operand 153 states and 225 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:34,822 INFO L93 Difference]: Finished difference Result 396 states and 584 transitions. [2025-03-03 21:05:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:05:34,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2025-03-03 21:05:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:34,825 INFO L225 Difference]: With dead ends: 396 [2025-03-03 21:05:34,825 INFO L226 Difference]: Without dead ends: 246 [2025-03-03 21:05:34,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 154 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-03 21:05:34,826 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 107 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:34,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 310 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:05:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-03 21:05:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 156. [2025-03-03 21:05:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 105 states have internal predecessors, (137), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:05:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 229 transitions. [2025-03-03 21:05:34,844 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 229 transitions. Word has length 156 [2025-03-03 21:05:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:34,844 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 229 transitions. [2025-03-03 21:05:34,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:05:34,845 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 229 transitions. [2025-03-03 21:05:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 21:05:34,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:34,846 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:34,856 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 (5)] Ended with exit code 0 [2025-03-03 21:05:35,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-03 21:05:35,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:35,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:35,048 INFO L85 PathProgramCache]: Analyzing trace with hash -640950013, now seen corresponding path program 1 times [2025-03-03 21:05:35,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:05:35,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882417569] [2025-03-03 21:05:35,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:35,048 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-03 21:05:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:05:35,051 INFO L229 MonitoredProcess]: Starting monitored process 6 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-03 21:05:35,052 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 (6)] Waiting until timeout for monitored process [2025-03-03 21:05:35,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:05:35,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:05:35,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:35,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:35,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 21:05:35,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:05:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-03 21:05:35,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:05:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:05:35,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:05:35,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882417569] [2025-03-03 21:05:35,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882417569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:05:35,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:05:35,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-03 21:05:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903418687] [2025-03-03 21:05:35,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:05:35,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 21:05:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:05:35,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 21:05:35,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 21:05:35,737 INFO L87 Difference]: Start difference. First operand 156 states and 229 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:05:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:05:38,081 INFO L93 Difference]: Finished difference Result 486 states and 700 transitions. [2025-03-03 21:05:38,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 21:05:38,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 156 [2025-03-03 21:05:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:05:38,083 INFO L225 Difference]: With dead ends: 486 [2025-03-03 21:05:38,083 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 21:05:38,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2025-03-03 21:05:38,085 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 470 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:05:38,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 772 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 21:05:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 21:05:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 161. [2025-03-03 21:05:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 108 states have internal predecessors, (138), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:05:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2025-03-03 21:05:38,121 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 156 [2025-03-03 21:05:38,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:05:38,122 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2025-03-03 21:05:38,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:05:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2025-03-03 21:05:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 21:05:38,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:05:38,125 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:05:38,135 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 (6)] Ended with exit code 0 [2025-03-03 21:05:38,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-03 21:05:38,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:05:38,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:05:38,326 INFO L85 PathProgramCache]: Analyzing trace with hash 972639265, now seen corresponding path program 1 times [2025-03-03 21:05:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:05:38,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475635576] [2025-03-03 21:05:38,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:05:38,327 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-03 21:05:38,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:05:38,329 INFO L229 MonitoredProcess]: Starting monitored process 7 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-03 21:05:38,329 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 (7)] Waiting until timeout for monitored process [2025-03-03 21:05:38,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 21:05:38,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 21:05:38,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:05:38,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:05:38,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 21:05:38,566 INFO L279 TraceCheckSpWp]: Computing forward predicates...