./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.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 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:25:38,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:25:38,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:25:38,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:25:38,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:25:38,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:25:39,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:25:39,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:25:39,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:25:39,003 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:25:39,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:25:39,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:25:39,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:25:39,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:25:39,006 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:25:39,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:25:39,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:25:39,007 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:25:39,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:25:39,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:25:39,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:25:39,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:25:39,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:25:39,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:25:39,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:25:39,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:25:39,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:25:39,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:25:39,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:25:39,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:25:39,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:25:39,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:25:39,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:25:39,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:25:39,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:25:39,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:25:39,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:25:39,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:25:39,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:25:39,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:25:39,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:25:39,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:25:39,016 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d [2024-11-20 06:25:39,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:25:39,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:25:39,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:25:39,333 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:25:39,333 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:25:39,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-20 06:25:40,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:25:40,996 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:25:41,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-20 06:25:41,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa91d233/2e0365020882413ca96dca2e253d9709/FLAGa36e5a146 [2024-11-20 06:25:41,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aa91d233/2e0365020882413ca96dca2e253d9709 [2024-11-20 06:25:41,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:25:41,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:25:41,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:25:41,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:25:41,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:25:41,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,362 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655e8bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41, skipping insertion in model container [2024-11-20 06:25:41,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:25:41,593 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_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-20 06:25:41,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:25:41,698 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:25:41,714 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_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-20 06:25:41,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:25:41,796 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:25:41,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41 WrapperNode [2024-11-20 06:25:41,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:25:41,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:25:41,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:25:41,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:25:41,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,867 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-20 06:25:41,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:25:41,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:25:41,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:25:41,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:25:41,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,902 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]. [2024-11-20 06:25:41,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:25:41,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:25:41,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:25:41,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:25:41,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (1/1) ... [2024-11-20 06:25:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:25:41,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:25:41,978 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) [2024-11-20 06:25:41,983 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 [2024-11-20 06:25:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:25:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:25:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:25:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:25:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:25:42,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:25:42,121 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:25:42,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:25:42,641 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-20 06:25:42,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:25:42,659 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:25:42,659 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:25:42,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:25:42 BoogieIcfgContainer [2024-11-20 06:25:42,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:25:42,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:25:42,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:25:42,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:25:42,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:25:41" (1/3) ... [2024-11-20 06:25:42,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6533ece4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:25:42, skipping insertion in model container [2024-11-20 06:25:42,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:25:41" (2/3) ... [2024-11-20 06:25:42,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6533ece4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:25:42, skipping insertion in model container [2024-11-20 06:25:42,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:25:42" (3/3) ... [2024-11-20 06:25:42,673 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-20 06:25:42,688 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:25:42,688 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:25:42,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:25:42,759 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;@fdbd7ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:25:42,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:25:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:25:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 06:25:42,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:42,781 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:25:42,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:42,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1211062472, now seen corresponding path program 1 times [2024-11-20 06:25:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:42,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481953994] [2024-11-20 06:25:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:25:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:25:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:25:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:25:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:25:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:25:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:25:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:25:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:25:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:25:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:25:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:25:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:25:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481953994] [2024-11-20 06:25:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481953994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:43,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:43,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:25:43,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788726928] [2024-11-20 06:25:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:43,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:25:43,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:43,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:25:43,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:25:43,456 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 06:25:43,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:43,498 INFO L93 Difference]: Finished difference Result 163 states and 280 transitions. [2024-11-20 06:25:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:25:43,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-11-20 06:25:43,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:43,510 INFO L225 Difference]: With dead ends: 163 [2024-11-20 06:25:43,510 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 06:25:43,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:25:43,523 INFO L432 NwaCegarLoop]: 123 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, 123 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 [2024-11-20 06:25:43,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:25:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 06:25:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-20 06:25:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:25:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-11-20 06:25:43,584 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 160 [2024-11-20 06:25:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:43,584 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-11-20 06:25:43,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 06:25:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-11-20 06:25:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 06:25:43,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:43,590 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:25:43,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:25:43,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:43,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1796506252, now seen corresponding path program 1 times [2024-11-20 06:25:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911220438] [2024-11-20 06:25:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:25:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:25:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:25:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:25:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:25:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:25:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:25:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:25:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:25:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:25:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:25:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:25:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:25:44,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:44,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911220438] [2024-11-20 06:25:44,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911220438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:44,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:25:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44708265] [2024-11-20 06:25:44,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:44,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:25:44,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:25:44,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:25:44,432 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:25:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:44,677 INFO L93 Difference]: Finished difference Result 238 states and 364 transitions. [2024-11-20 06:25:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:25:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-11-20 06:25:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:44,685 INFO L225 Difference]: With dead ends: 238 [2024-11-20 06:25:44,685 INFO L226 Difference]: Without dead ends: 160 [2024-11-20 06:25:44,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:25:44,688 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 106 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:44,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 347 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:25:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-20 06:25:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2024-11-20 06:25:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 06:25:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 198 transitions. [2024-11-20 06:25:44,739 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 198 transitions. Word has length 160 [2024-11-20 06:25:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:44,740 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 198 transitions. [2024-11-20 06:25:44,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:25:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 198 transitions. [2024-11-20 06:25:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 06:25:44,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:44,747 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:25:44,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:25:44,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:44,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:44,752 INFO L85 PathProgramCache]: Analyzing trace with hash -387667324, now seen corresponding path program 1 times [2024-11-20 06:25:44,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:44,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479973073] [2024-11-20 06:25:44,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:44,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:25:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:25:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:25:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:25:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:25:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:25:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:25:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:25:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:25:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:25:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:25:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:25:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:25:46,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479973073] [2024-11-20 06:25:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479973073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 06:25:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898301032] [2024-11-20 06:25:46,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:25:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:46,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:25:46,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:25:46,890 INFO L87 Difference]: Start difference. First operand 130 states and 198 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-20 06:25:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:48,311 INFO L93 Difference]: Finished difference Result 324 states and 482 transitions. [2024-11-20 06:25:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:25:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 161 [2024-11-20 06:25:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:48,315 INFO L225 Difference]: With dead ends: 324 [2024-11-20 06:25:48,316 INFO L226 Difference]: Without dead ends: 240 [2024-11-20 06:25:48,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-20 06:25:48,318 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 484 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:48,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 941 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 06:25:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-20 06:25:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 163. [2024-11-20 06:25:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 110 states have internal predecessors, (142), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 06:25:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2024-11-20 06:25:48,355 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 161 [2024-11-20 06:25:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:48,355 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2024-11-20 06:25:48,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-20 06:25:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2024-11-20 06:25:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 06:25:48,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:48,358 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:25:48,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:25:48,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:48,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 892196354, now seen corresponding path program 1 times [2024-11-20 06:25:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851421917] [2024-11-20 06:25:48,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:25:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:25:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:25:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:25:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:25:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:25:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:25:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:25:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:25:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:25:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:25:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:25:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:25:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851421917] [2024-11-20 06:25:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851421917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:25:49,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:25:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:25:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252954840] [2024-11-20 06:25:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:25:49,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:25:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:49,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:25:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:25:49,137 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:25:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:49,622 INFO L93 Difference]: Finished difference Result 409 states and 612 transitions. [2024-11-20 06:25:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:25:49,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-20 06:25:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:49,628 INFO L225 Difference]: With dead ends: 409 [2024-11-20 06:25:49,628 INFO L226 Difference]: Without dead ends: 331 [2024-11-20 06:25:49,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:25:49,630 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 228 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:49,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 571 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:25:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-20 06:25:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 234. [2024-11-20 06:25:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 163 states have (on average 1.343558282208589) internal successors, (219), 165 states have internal predecessors, (219), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 06:25:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 351 transitions. [2024-11-20 06:25:49,690 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 351 transitions. Word has length 161 [2024-11-20 06:25:49,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:49,692 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 351 transitions. [2024-11-20 06:25:49,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:25:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 351 transitions. [2024-11-20 06:25:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 06:25:49,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:49,695 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:25:49,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:25:49,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:49,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash -118920896, now seen corresponding path program 1 times [2024-11-20 06:25:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:49,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229402401] [2024-11-20 06:25:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:49,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:25:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:25:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:25:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:25:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:25:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:25:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:25:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:25:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:25:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:25:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:25:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:25:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 111 proven. 21 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-20 06:25:50,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229402401] [2024-11-20 06:25:50,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229402401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:25:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376445495] [2024-11-20 06:25:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:50,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:25:50,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:25:50,383 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) [2024-11-20 06:25:50,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 06:25:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:50,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 06:25:50,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:25:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 542 proven. 21 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2024-11-20 06:25:51,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:25:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 111 proven. 24 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-20 06:25:51,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376445495] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:25:51,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:25:51,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 23 [2024-11-20 06:25:51,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861250111] [2024-11-20 06:25:51,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:25:51,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-20 06:25:51,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:51,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 06:25:51,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2024-11-20 06:25:51,661 INFO L87 Difference]: Start difference. First operand 234 states and 351 transitions. Second operand has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 8 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 8 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-20 06:25:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:52,678 INFO L93 Difference]: Finished difference Result 473 states and 693 transitions. [2024-11-20 06:25:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-20 06:25:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 8 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 8 states have call predecessors, (56), 8 states have call successors, (56) Word has length 161 [2024-11-20 06:25:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:52,682 INFO L225 Difference]: With dead ends: 473 [2024-11-20 06:25:52,682 INFO L226 Difference]: Without dead ends: 295 [2024-11-20 06:25:52,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=526, Invalid=1544, Unknown=0, NotChecked=0, Total=2070 [2024-11-20 06:25:52,684 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 373 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:52,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 525 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 06:25:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-20 06:25:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 247. [2024-11-20 06:25:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 172 states have (on average 1.2906976744186047) internal successors, (222), 174 states have internal predecessors, (222), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 06:25:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 354 transitions. [2024-11-20 06:25:52,725 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 354 transitions. Word has length 161 [2024-11-20 06:25:52,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:52,726 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 354 transitions. [2024-11-20 06:25:52,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 8 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 8 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-20 06:25:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 354 transitions. [2024-11-20 06:25:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 06:25:52,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:52,729 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:25:52,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 06:25:52,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:25:52,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:52,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:52,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1976015226, now seen corresponding path program 1 times [2024-11-20 06:25:52,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:52,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985227172] [2024-11-20 06:25:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:52,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:25:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:25:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:25:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:25:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:25:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:25:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 06:25:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:25:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 06:25:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:25:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 06:25:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:25:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:25:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:25:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:25:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:25:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:25:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:25:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:25:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:25:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:25:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:25:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:25:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:25:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:25:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:25:53,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985227172] [2024-11-20 06:25:53,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985227172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:25:53,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236774501] [2024-11-20 06:25:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:53,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:25:53,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:25:53,387 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) [2024-11-20 06:25:53,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 06:25:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:25:53,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 06:25:53,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:25:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 512 proven. 36 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-20 06:25:53,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:25:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:25:53,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236774501] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:25:53,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:25:53,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-20 06:25:53,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659743209] [2024-11-20 06:25:53,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:25:53,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 06:25:53,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:25:53,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 06:25:53,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:25:53,950 INFO L87 Difference]: Start difference. First operand 247 states and 354 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-20 06:25:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:25:54,685 INFO L93 Difference]: Finished difference Result 532 states and 751 transitions. [2024-11-20 06:25:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-20 06:25:54,686 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 161 [2024-11-20 06:25:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:25:54,688 INFO L225 Difference]: With dead ends: 532 [2024-11-20 06:25:54,689 INFO L226 Difference]: Without dead ends: 352 [2024-11-20 06:25:54,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2024-11-20 06:25:54,691 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 261 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 06:25:54,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 570 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 06:25:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-20 06:25:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 251. [2024-11-20 06:25:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 174 states have (on average 1.2586206896551724) internal successors, (219), 176 states have internal predecessors, (219), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 06:25:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 351 transitions. [2024-11-20 06:25:54,737 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 351 transitions. Word has length 161 [2024-11-20 06:25:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:25:54,737 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 351 transitions. [2024-11-20 06:25:54,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-20 06:25:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 351 transitions. [2024-11-20 06:25:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 06:25:54,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:25:54,739 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:25:54,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 06:25:54,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 06:25:54,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:25:54,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:25:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1604090165, now seen corresponding path program 1 times [2024-11-20 06:25:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:25:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381676303] [2024-11-20 06:25:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:25:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:25:55,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030670915] [2024-11-20 06:25:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:25:55,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:25:55,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:25:55,141 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) [2024-11-20 06:25:55,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 06:25:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:25:55,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:25:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:25:55,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:25:55,560 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:25:55,561 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:25:55,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 06:25:55,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:25:55,769 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:25:55,890 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:25:55,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:25:55 BoogieIcfgContainer [2024-11-20 06:25:55,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:25:55,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:25:55,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:25:55,894 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:25:55,894 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:25:42" (3/4) ... [2024-11-20 06:25:55,897 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:25:55,898 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:25:55,898 INFO L158 Benchmark]: Toolchain (without parser) took 14548.17ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 104.0MB in the beginning and 203.9MB in the end (delta: -100.0MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2024-11-20 06:25:55,899 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:25:55,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.42ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 86.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 06:25:55,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.25ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 82.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:25:55,899 INFO L158 Benchmark]: Boogie Preprocessor took 67.76ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 77.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:25:55,900 INFO L158 Benchmark]: RCFGBuilder took 725.47ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 77.1MB in the beginning and 180.9MB in the end (delta: -103.8MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-20 06:25:55,900 INFO L158 Benchmark]: TraceAbstraction took 13227.59ms. Allocated memory was 226.5MB in the beginning and 327.2MB in the end (delta: 100.7MB). Free memory was 179.8MB in the beginning and 203.9MB in the end (delta: -24.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-20 06:25:55,900 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 327.2MB. Free memory is still 203.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:25:55,901 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.20ms. Allocated memory is still 159.4MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.42ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 86.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.25ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 82.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.76ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 77.5MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 725.47ms. Allocated memory was 159.4MB in the beginning and 226.5MB in the end (delta: 67.1MB). Free memory was 77.1MB in the beginning and 180.9MB in the end (delta: -103.8MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13227.59ms. Allocated memory was 226.5MB in the beginning and 327.2MB in the end (delta: 100.7MB). Free memory was 179.8MB in the beginning and 203.9MB in the end (delta: -24.1MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 327.2MB. Free memory is still 203.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -2; [L23] signed char var_1_4 = 0; [L24] signed char var_1_5 = -5; [L25] signed short int var_1_6 = -32; [L26] signed char var_1_7 = 8; [L27] unsigned char var_1_8 = 2; [L28] float var_1_10 = 15.6; [L29] unsigned char var_1_11 = 10; [L30] unsigned short int var_1_12 = 64; [L31] signed long int var_1_13 = -8; [L32] unsigned long int var_1_14 = 64; [L33] float var_1_17 = 9.75; [L34] float var_1_18 = 0.5; [L35] signed short int var_1_19 = -128; [L36] unsigned char var_1_21 = 1; [L37] unsigned long int var_1_22 = 3552880340; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 1; [L44] unsigned char var_1_29 = 0; [L45] signed short int var_1_30 = 10; [L46] float var_1_31 = 99.25; [L47] signed long int var_1_32 = 256; [L48] signed short int last_1_var_1_6 = -32; [L49] signed long int last_1_var_1_13 = -8; [L50] unsigned long int last_1_var_1_14 = 64; [L51] float last_1_var_1_17 = 9.75; [L52] signed short int last_1_var_1_19 = -128; [L53] unsigned char last_1_var_1_21 = 1; [L54] float last_1_var_1_31 = 99.25; [L55] signed long int last_1_var_1_32 = 256; VAL [isInitial=0, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L175] last_1_var_1_6 = var_1_6 [L176] last_1_var_1_13 = var_1_13 [L177] last_1_var_1_14 = var_1_14 [L178] last_1_var_1_17 = var_1_17 [L179] last_1_var_1_19 = var_1_19 [L180] last_1_var_1_21 = var_1_21 [L181] last_1_var_1_31 = var_1_31 [L182] last_1_var_1_32 = var_1_32 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L137] var_1_4 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L138] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L139] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L139] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L140] var_1_5 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=8, var_1_8=2] [L141] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=8, var_1_8=2] [L142] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=8, var_1_8=2] [L142] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=8, var_1_8=2] [L143] var_1_7 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_7 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L144] RET assume_abort_if_not(var_1_7 >= -128) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L145] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L145] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L146] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L146] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L147] var_1_10 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L148] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L149] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L149] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L150] var_1_11 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L151] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L152] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L152] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L153] var_1_18 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L154] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L155] var_1_22 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L156] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L157] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L157] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L158] var_1_23 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L159] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L160] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L160] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L161] var_1_24 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L162] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L163] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L163] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L164] var_1_26 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L165] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L166] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L166] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L167] var_1_27 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L169] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L169] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L171] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L172] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L172] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L193] RET updateVariables() [L194] CALL step() [L59] COND FALSE !(-2 == last_1_var_1_32) [L66] var_1_1 = (var_1_5 + 5) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L68] var_1_32 = var_1_1 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-32, var_1_7=-13, var_1_8=2] [L69] COND TRUE var_1_5 > (last_1_var_1_13 % var_1_7) [L70] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=2] [L74] unsigned char stepLocal_4 = (- var_1_18) > last_1_var_1_31; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_4=1, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=2] [L75] COND TRUE last_1_var_1_21 || stepLocal_4 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=2] [L76] COND FALSE !(! last_1_var_1_21) [L79] var_1_25 = var_1_24 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=2] [L84] var_1_12 = var_1_11 [L85] var_1_30 = var_1_1 [L86] var_1_31 = 24.4f [L87] unsigned char stepLocal_0 = (var_1_31 / var_1_10) < 255.625f; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_0=1, var_1_11=5, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=2] [L88] COND TRUE stepLocal_0 && (var_1_7 < (var_1_5 * -100)) [L89] var_1_8 = (((((128 - var_1_4)) > (var_1_11)) ? ((128 - var_1_4)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L93] signed char stepLocal_5 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_5=-13, var_1_11=5, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L94] COND TRUE stepLocal_5 <= (~ var_1_1) [L95] var_1_28 = (! (! (var_1_24 && var_1_29))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L99] COND TRUE var_1_25 || var_1_28 [L100] var_1_14 = ((last_1_var_1_14 + 1u) + var_1_11) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L102] COND TRUE (64 - ((((-64) < 0 ) ? -(-64) : (-64)))) <= (var_1_14 + (var_1_8 * var_1_4)) [L103] var_1_17 = 100.5f VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L107] COND FALSE !((var_1_31 + (var_1_10 + var_1_31)) > (var_1_18 * var_1_17)) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L114] signed char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_1=-7, var_1_11=5, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L115] COND TRUE ((last_1_var_1_6 * var_1_11) / 10) <= stepLocal_1 [L116] var_1_13 = (var_1_7 + (var_1_11 - ((((last_1_var_1_13) < (last_1_var_1_32)) ? (last_1_var_1_13) : (last_1_var_1_32))))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L124] EXPR 256u & var_1_13 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L124] unsigned char stepLocal_3 = (256u & var_1_13) == (var_1_22 - var_1_12); [L125] unsigned short int stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_2=5, stepLocal_3=0, var_1_11=5, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L126] COND TRUE stepLocal_3 || var_1_25 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_2=5, var_1_11=5, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L127] COND TRUE var_1_13 != stepLocal_2 [L128] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=0, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((((((((-2 == last_1_var_1_32) ? (((last_1_var_1_32 * last_1_var_1_6) <= -500) ? (var_1_1 == ((signed char) ((((2 - var_1_4) < 0 ) ? -(2 - var_1_4) : (2 - var_1_4))))) : (var_1_1 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) : (var_1_1 == ((signed char) (var_1_5 + 5)))) && ((var_1_5 > (last_1_var_1_13 % var_1_7)) ? (var_1_6 == ((signed short int) var_1_5)) : (var_1_6 == ((signed short int) (var_1_5 + var_1_7))))) && ((((var_1_31 / var_1_10) < 255.625f) && (var_1_7 < (var_1_5 * -100))) ? (var_1_8 == ((unsigned char) (((((128 - var_1_4)) > (var_1_11)) ? ((128 - var_1_4)) : (var_1_11))))) : (var_1_8 == ((unsigned char) var_1_4)))) && (var_1_12 == ((unsigned short int) var_1_11))) && ((((last_1_var_1_6 * var_1_11) / 10) <= var_1_5) ? (var_1_13 == ((signed long int) (var_1_7 + (var_1_11 - ((((last_1_var_1_13) < (last_1_var_1_32)) ? (last_1_var_1_13) : (last_1_var_1_32))))))) : (((- (- last_1_var_1_17)) < var_1_10) ? (var_1_13 == ((signed long int) (var_1_7 + var_1_5))) : (var_1_13 == ((signed long int) var_1_4))))) && ((var_1_25 || var_1_28) ? (var_1_14 == ((unsigned long int) ((last_1_var_1_14 + 1u) + var_1_11))) : 1)) && (((64 - ((((-64) < 0 ) ? -(-64) : (-64)))) <= (var_1_14 + (var_1_8 * var_1_4))) ? (var_1_17 == ((float) 100.5f)) : (var_1_17 == ((float) var_1_18)))) && (((var_1_31 + (var_1_10 + var_1_31)) > (var_1_18 * var_1_17)) ? (var_1_25 ? (var_1_19 == ((signed short int) var_1_7)) : (var_1_19 == ((signed short int) last_1_var_1_19))) : 1)) && ((((256u & var_1_13) == (var_1_22 - var_1_12)) || var_1_25) ? ((var_1_13 != var_1_12) ? (var_1_21 == ((unsigned char) var_1_23)) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=0, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L185-L186] return ((((((((((((((-2 == last_1_var_1_32) ? (((last_1_var_1_32 * last_1_var_1_6) <= -500) ? (var_1_1 == ((signed char) ((((2 - var_1_4) < 0 ) ? -(2 - var_1_4) : (2 - var_1_4))))) : (var_1_1 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) : (var_1_1 == ((signed char) (var_1_5 + 5)))) && ((var_1_5 > (last_1_var_1_13 % var_1_7)) ? (var_1_6 == ((signed short int) var_1_5)) : (var_1_6 == ((signed short int) (var_1_5 + var_1_7))))) && ((((var_1_31 / var_1_10) < 255.625f) && (var_1_7 < (var_1_5 * -100))) ? (var_1_8 == ((unsigned char) (((((128 - var_1_4)) > (var_1_11)) ? ((128 - var_1_4)) : (var_1_11))))) : (var_1_8 == ((unsigned char) var_1_4)))) && (var_1_12 == ((unsigned short int) var_1_11))) && ((((last_1_var_1_6 * var_1_11) / 10) <= var_1_5) ? (var_1_13 == ((signed long int) (var_1_7 + (var_1_11 - ((((last_1_var_1_13) < (last_1_var_1_32)) ? (last_1_var_1_13) : (last_1_var_1_32))))))) : (((- (- last_1_var_1_17)) < var_1_10) ? (var_1_13 == ((signed long int) (var_1_7 + var_1_5))) : (var_1_13 == ((signed long int) var_1_4))))) && ((var_1_25 || var_1_28) ? (var_1_14 == ((unsigned long int) ((last_1_var_1_14 + 1u) + var_1_11))) : 1)) && (((64 - ((((-64) < 0 ) ? -(-64) : (-64)))) <= (var_1_14 + (var_1_8 * var_1_4))) ? (var_1_17 == ((float) 100.5f)) : (var_1_17 == ((float) var_1_18)))) && (((var_1_31 + (var_1_10 + var_1_31)) > (var_1_18 * var_1_17)) ? (var_1_25 ? (var_1_19 == ((signed short int) var_1_7)) : (var_1_19 == ((signed short int) last_1_var_1_19))) : 1)) && ((((256u & var_1_13) == (var_1_22 - var_1_12)) || var_1_25) ? ((var_1_13 != var_1_12) ? (var_1_21 == ((unsigned char) var_1_23)) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_24)))) && ((last_1_var_1_21 || ((- var_1_18) > last_1_var_1_31)) ? ((! last_1_var_1_21) ? (var_1_25 == ((unsigned char) ((var_1_23 || var_1_26) || var_1_27))) : (var_1_25 == ((unsigned char) var_1_24))) : (var_1_25 == ((unsigned char) var_1_24)))) && ((var_1_7 <= (~ var_1_1)) ? (var_1_28 == ((unsigned char) (! (! (var_1_24 && var_1_29))))) : (var_1_28 == ((unsigned char) ((var_1_31 == 8.5f) || (var_1_29 && var_1_24)))))) && (var_1_30 == ((signed short int) var_1_1))) && (var_1_31 == ((float) 24.4f))) && (var_1_32 == ((signed long int) var_1_1)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=0, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=5, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=-2, var_1_21=0, var_1_22=-6442450945, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=-2, var_1_31=122/5, var_1_32=-2, var_1_4=126, var_1_5=-7, var_1_6=-7, var_1_7=-13, var_1_8=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1502 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1452 mSDsluCounter, 3077 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2218 mSDsCounter, 605 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1823 IncrementalHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 605 mSolverCounterUnsat, 859 mSDtfsCounter, 1823 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 951 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=6, InterpolantAutomatonStates: 72, 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, 6 MinimizatonAttempts, 353 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1610 NumberOfCodeBlocks, 1610 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1598 ConstructedInterpolants, 0 QuantifiedInterpolants, 7043 SizeOfPredicates, 8 NumberOfNonLiveVariables, 826 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 10896/11040 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 06:25:55,942 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/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.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 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:25:58,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:25:58,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:25:58,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:25:58,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:25:58,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:25:58,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:25:58,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:25:58,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:25:58,254 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:25:58,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:25:58,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:25:58,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:25:58,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:25:58,256 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:25:58,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:25:58,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:25:58,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:25:58,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:25:58,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:25:58,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:25:58,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:25:58,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:25:58,263 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:25:58,263 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:25:58,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:25:58,264 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:25:58,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:25:58,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:25:58,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:25:58,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:25:58,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:25:58,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:25:58,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:25:58,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:25:58,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:25:58,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:25:58,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:25:58,266 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:25:58,268 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:25:58,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:25:58,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:25:58,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:25:58,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:25:58,269 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d [2024-11-20 06:25:58,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:25:58,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:25:58,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:25:58,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:25:58,613 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:25:58,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-20 06:26:00,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:26:00,380 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:26:00,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-20 06:26:00,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55697a42/c555c284ca294cb584ac5e5173ff6b6a/FLAGb0b8fa69d [2024-11-20 06:26:00,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55697a42/c555c284ca294cb584ac5e5173ff6b6a [2024-11-20 06:26:00,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:26:00,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:26:00,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:26:00,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:26:00,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:26:00,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:26:00" (1/1) ... [2024-11-20 06:26:00,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29261dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:00, skipping insertion in model container [2024-11-20 06:26:00,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:26:00" (1/1) ... [2024-11-20 06:26:00,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:26:00,980 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_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-20 06:26:01,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:26:01,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:26:01,116 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_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-20 06:26:01,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:26:01,202 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:26:01,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01 WrapperNode [2024-11-20 06:26:01,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:26:01,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:26:01,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:26:01,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:26:01,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,264 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-20 06:26:01,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:26:01,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:26:01,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:26:01,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:26:01,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,304 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]. [2024-11-20 06:26:01,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:26:01,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:26:01,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:26:01,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:26:01,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (1/1) ... [2024-11-20 06:26:01,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:26:01,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:26:01,390 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) [2024-11-20 06:26:01,396 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 [2024-11-20 06:26:01,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:26:01,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:26:01,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:26:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:26:01,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:26:01,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:26:01,508 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:26:01,509 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:26:08,983 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 06:26:08,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:26:09,001 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:26:09,002 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:26:09,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:26:09 BoogieIcfgContainer [2024-11-20 06:26:09,003 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:26:09,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:26:09,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:26:09,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:26:09,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:26:00" (1/3) ... [2024-11-20 06:26:09,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f1245f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:26:09, skipping insertion in model container [2024-11-20 06:26:09,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:26:01" (2/3) ... [2024-11-20 06:26:09,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f1245f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:26:09, skipping insertion in model container [2024-11-20 06:26:09,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:26:09" (3/3) ... [2024-11-20 06:26:09,014 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-20 06:26:09,032 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:26:09,033 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:26:09,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:26:09,097 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;@2496a2f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:26:09,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:26:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:26:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 06:26:09,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:09,122 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:26:09,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:09,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 911881905, now seen corresponding path program 1 times [2024-11-20 06:26:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:26:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942925930] [2024-11-20 06:26:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:09,146 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 [2024-11-20 06:26:09,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:26:09,150 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) [2024-11-20 06:26:09,154 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 [2024-11-20 06:26:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:09,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:26:09,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:26:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-20 06:26:09,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:26:09,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:26:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942925930] [2024-11-20 06:26:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942925930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:26:09,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:26:09,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:26:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144260581] [2024-11-20 06:26:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:26:09,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:26:09,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:26:09,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:26:09,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:26:09,721 INFO L87 Difference]: Start difference. First operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 06:26:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:09,747 INFO L93 Difference]: Finished difference Result 145 states and 252 transitions. [2024-11-20 06:26:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:26:09,749 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-11-20 06:26:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:09,756 INFO L225 Difference]: With dead ends: 145 [2024-11-20 06:26:09,756 INFO L226 Difference]: Without dead ends: 72 [2024-11-20 06:26:09,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:26:09,762 INFO L432 NwaCegarLoop]: 109 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, 109 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 [2024-11-20 06:26:09,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:26:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-20 06:26:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-20 06:26:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:26:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2024-11-20 06:26:09,808 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 157 [2024-11-20 06:26:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:09,809 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2024-11-20 06:26:09,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 06:26:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2024-11-20 06:26:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 06:26:09,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:09,814 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:26:09,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:26:10,015 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 [2024-11-20 06:26:10,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:10,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:10,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1627849581, now seen corresponding path program 1 times [2024-11-20 06:26:10,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:26:10,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970024009] [2024-11-20 06:26:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:10,018 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 [2024-11-20 06:26:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:26:10,039 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) [2024-11-20 06:26:10,042 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 [2024-11-20 06:26:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:10,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 06:26:10,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:26:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:26:12,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:26:12,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:26:12,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970024009] [2024-11-20 06:26:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970024009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:26:12,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:26:12,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:26:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026011531] [2024-11-20 06:26:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:26:12,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:26:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:26:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:26:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:26:12,019 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:26:16,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:26:18,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:26:21,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:26:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:21,698 INFO L93 Difference]: Finished difference Result 211 states and 322 transitions. [2024-11-20 06:26:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:26:21,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-20 06:26:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:21,744 INFO L225 Difference]: With dead ends: 211 [2024-11-20 06:26:21,744 INFO L226 Difference]: Without dead ends: 142 [2024-11-20 06:26:21,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:26:21,746 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 84 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:21,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 306 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2024-11-20 06:26:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-20 06:26:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 121. [2024-11-20 06:26:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 06:26:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2024-11-20 06:26:21,783 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 157 [2024-11-20 06:26:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:21,783 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2024-11-20 06:26:21,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:26:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2024-11-20 06:26:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 06:26:21,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:21,786 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:26:21,806 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 [2024-11-20 06:26:21,987 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 [2024-11-20 06:26:21,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:21,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1305132533, now seen corresponding path program 1 times [2024-11-20 06:26:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:26:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514302226] [2024-11-20 06:26:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:21,989 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 [2024-11-20 06:26:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:26:21,991 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) [2024-11-20 06:26:21,992 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 [2024-11-20 06:26:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:22,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 06:26:22,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:26:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 512 proven. 36 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-20 06:26:24,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:26:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:26:25,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:26:25,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514302226] [2024-11-20 06:26:25,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514302226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:26:25,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:26:25,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-20 06:26:25,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036898644] [2024-11-20 06:26:25,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:26:25,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:26:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:26:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:26:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:26:25,283 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-20 06:26:31,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:26:32,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:26:38,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:26:41,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:26:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:26:42,153 INFO L93 Difference]: Finished difference Result 360 states and 521 transitions. [2024-11-20 06:26:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 06:26:42,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 158 [2024-11-20 06:26:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:26:42,160 INFO L225 Difference]: With dead ends: 360 [2024-11-20 06:26:42,160 INFO L226 Difference]: Without dead ends: 291 [2024-11-20 06:26:42,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-11-20 06:26:42,164 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 180 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 105 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2024-11-20 06:26:42,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 531 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 523 Invalid, 2 Unknown, 0 Unchecked, 15.5s Time] [2024-11-20 06:26:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-20 06:26:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 150. [2024-11-20 06:26:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 95 states have internal predecessors, (118), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 06:26:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 214 transitions. [2024-11-20 06:26:42,217 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 214 transitions. Word has length 158 [2024-11-20 06:26:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:26:42,217 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 214 transitions. [2024-11-20 06:26:42,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-20 06:26:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2024-11-20 06:26:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 06:26:42,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:26:42,221 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:26:42,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 06:26:42,424 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 [2024-11-20 06:26:42,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:26:42,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:26:42,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1568842632, now seen corresponding path program 1 times [2024-11-20 06:26:42,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:26:42,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092509188] [2024-11-20 06:26:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:26:42,427 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 [2024-11-20 06:26:42,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:26:42,430 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) [2024-11-20 06:26:42,431 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 [2024-11-20 06:26:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:26:42,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-20 06:26:42,860 INFO L278 TraceCheckSpWp]: Computing forward predicates...