./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.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 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:40:56,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:40:56,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:40:56,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:40:56,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:40:57,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:40:57,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:40:57,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:40:57,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:40:57,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:40:57,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:40:57,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:40:57,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:40:57,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:40:57,011 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:40:57,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:40:57,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:40:57,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:40:57,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:40:57,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:40:57,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:40:57,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:40:57,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:40:57,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:40:57,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:40:57,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:40:57,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:40:57,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:40:57,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:40:57,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:40:57,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:40:57,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:40:57,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:40:57,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:40:57,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:40:57,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:40:57,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:40:57,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:40:57,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:40:57,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:40:57,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:40:57,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:40:57,021 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 -> 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a [2024-11-12 03:40:57,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:40:57,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:40:57,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:40:57,314 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:40:57,315 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:40:57,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-12 03:40:58,760 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:40:58,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:40:58,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-12 03:40:58,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6ef041d/def7ccbfe0b445fdab9f09b611f4e35a/FLAG718e61d7c [2024-11-12 03:40:59,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b6ef041d/def7ccbfe0b445fdab9f09b611f4e35a [2024-11-12 03:40:59,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:40:59,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:40:59,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:40:59,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:40:59,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:40:59,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2e533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59, skipping insertion in model container [2024-11-12 03:40:59,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:40:59,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-11-12 03:40:59,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:40:59,576 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:40:59,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-11-12 03:40:59,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:40:59,646 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:40:59,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59 WrapperNode [2024-11-12 03:40:59,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:40:59,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:40:59,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:40:59,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:40:59,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,721 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-11-12 03:40:59,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:40:59,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:40:59,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:40:59,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:40:59,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,755 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-12 03:40:59,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,764 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:40:59,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:40:59,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:40:59,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:40:59,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (1/1) ... [2024-11-12 03:40:59,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:40:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:40:59,814 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-12 03:40:59,818 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-12 03:40:59,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:40:59,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:40:59,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:40:59,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:40:59,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:40:59,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:40:59,974 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:40:59,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:41:00,371 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 03:41:00,371 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:41:00,388 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:41:00,389 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:41:00,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:41:00 BoogieIcfgContainer [2024-11-12 03:41:00,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:41:00,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:41:00,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:41:00,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:41:00,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:40:59" (1/3) ... [2024-11-12 03:41:00,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd37737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:41:00, skipping insertion in model container [2024-11-12 03:41:00,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:40:59" (2/3) ... [2024-11-12 03:41:00,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd37737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:41:00, skipping insertion in model container [2024-11-12 03:41:00,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:41:00" (3/3) ... [2024-11-12 03:41:00,396 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-12 03:41:00,410 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:41:00,411 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:41:00,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:41:00,537 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;@79e769b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:41:00,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:41:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:41:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 03:41:00,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:00,563 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:00,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:00,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash 980803782, now seen corresponding path program 1 times [2024-11-12 03:41:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:41:00,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417048878] [2024-11-12 03:41:00,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:41:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:41:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:41:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:41:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:41:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:41:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:41:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:41:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:41:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:41:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:41:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:41:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:41:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:41:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:41:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:41:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:41:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:41:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:41:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:41:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:41:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:41:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:41:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:41:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:41:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:41:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:41:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:41:01,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:41:01,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417048878] [2024-11-12 03:41:01,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417048878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:41:01,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:41:01,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:41:01,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923394101] [2024-11-12 03:41:01,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:41:01,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:41:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:41:01,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:41:01,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:41:01,038 INFO L87 Difference]: Start difference. First operand has 104 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:41:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:41:01,070 INFO L93 Difference]: Finished difference Result 201 states and 346 transitions. [2024-11-12 03:41:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:41:01,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 174 [2024-11-12 03:41:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:41:01,081 INFO L225 Difference]: With dead ends: 201 [2024-11-12 03:41:01,082 INFO L226 Difference]: Without dead ends: 100 [2024-11-12 03:41:01,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-12 03:41:01,088 INFO L435 NwaCegarLoop]: 156 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, 156 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-12 03:41:01,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:41:01,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-12 03:41:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-12 03:41:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:41:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-11-12 03:41:01,142 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 174 [2024-11-12 03:41:01,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:41:01,143 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-11-12 03:41:01,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:41:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-11-12 03:41:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 03:41:01,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:01,146 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:01,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:41:01,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:01,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:01,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1748651918, now seen corresponding path program 1 times [2024-11-12 03:41:01,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:41:01,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726735939] [2024-11-12 03:41:01,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:01,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:41:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:41:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:41:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:41:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:41:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:41:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:41:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:41:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:41:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:41:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:41:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:41:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:41:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:41:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:41:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:41:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:41:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:41:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:41:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:41:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:41:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:41:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:41:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:41:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:41:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:41:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:41:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:41:01,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:41:01,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726735939] [2024-11-12 03:41:01,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726735939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:41:01,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:41:01,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:41:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996524941] [2024-11-12 03:41:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:41:01,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:41:01,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:41:01,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:41:01,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:41:01,761 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:41:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:41:01,885 INFO L93 Difference]: Finished difference Result 253 states and 397 transitions. [2024-11-12 03:41:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:41:01,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-12 03:41:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:41:01,889 INFO L225 Difference]: With dead ends: 253 [2024-11-12 03:41:01,889 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 03:41:01,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:41:01,892 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 38 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:41:01,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 258 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:41:01,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 03:41:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2024-11-12 03:41:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:41:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 237 transitions. [2024-11-12 03:41:01,947 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 237 transitions. Word has length 174 [2024-11-12 03:41:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:41:01,948 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 237 transitions. [2024-11-12 03:41:01,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:41:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 237 transitions. [2024-11-12 03:41:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 03:41:01,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:01,950 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:01,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:41:01,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:01,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash -455660467, now seen corresponding path program 1 times [2024-11-12 03:41:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:41:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599316434] [2024-11-12 03:41:01,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:41:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:41:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:41:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:41:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:41:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:41:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:41:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:41:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:41:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:41:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:41:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:41:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:41:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:41:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:41:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:41:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:41:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:41:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:41:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:41:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:41:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:41:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:41:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:41:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:41:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:41:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:41:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:41:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:41:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599316434] [2024-11-12 03:41:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599316434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:41:02,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:41:02,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:41:02,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414702844] [2024-11-12 03:41:02,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:41:02,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:41:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:41:02,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:41:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:41:02,119 INFO L87 Difference]: Start difference. First operand 152 states and 237 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:41:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:41:02,191 INFO L93 Difference]: Finished difference Result 250 states and 392 transitions. [2024-11-12 03:41:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:41:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 03:41:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:41:02,195 INFO L225 Difference]: With dead ends: 250 [2024-11-12 03:41:02,195 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 03:41:02,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:41:02,197 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:41:02,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:41:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 03:41:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-12 03:41:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 98 states have internal predecessors, (134), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:41:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 238 transitions. [2024-11-12 03:41:02,220 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 238 transitions. Word has length 175 [2024-11-12 03:41:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:41:02,220 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 238 transitions. [2024-11-12 03:41:02,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:41:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 238 transitions. [2024-11-12 03:41:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 03:41:02,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:02,224 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:02,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:41:02,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:02,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1221375017, now seen corresponding path program 1 times [2024-11-12 03:41:02,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:41:02,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916617874] [2024-11-12 03:41:02,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:02,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:41:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:41:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:41:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:41:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:41:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:41:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:41:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:41:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:41:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:41:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:41:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:41:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:41:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:41:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:41:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:41:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:41:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:41:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:41:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:41:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:41:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:41:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:41:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:41:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:41:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:41:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:41:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:41:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:41:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916617874] [2024-11-12 03:41:04,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916617874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:41:04,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:41:04,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 03:41:04,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732261273] [2024-11-12 03:41:04,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:41:04,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 03:41:04,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:41:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 03:41:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:41:04,437 INFO L87 Difference]: Start difference. First operand 153 states and 238 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:41:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:41:06,187 INFO L93 Difference]: Finished difference Result 460 states and 710 transitions. [2024-11-12 03:41:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 03:41:06,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-12 03:41:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:41:06,190 INFO L225 Difference]: With dead ends: 460 [2024-11-12 03:41:06,190 INFO L226 Difference]: Without dead ends: 362 [2024-11-12 03:41:06,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-12 03:41:06,192 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 595 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:41:06,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 920 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 03:41:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-12 03:41:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 312. [2024-11-12 03:41:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 225 states have (on average 1.4222222222222223) internal successors, (320), 226 states have internal predecessors, (320), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-12 03:41:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 484 transitions. [2024-11-12 03:41:06,221 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 484 transitions. Word has length 175 [2024-11-12 03:41:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:41:06,222 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 484 transitions. [2024-11-12 03:41:06,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:41:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 484 transitions. [2024-11-12 03:41:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 03:41:06,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:06,224 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:06,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:41:06,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash 200306663, now seen corresponding path program 1 times [2024-11-12 03:41:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:41:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258055582] [2024-11-12 03:41:06,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:41:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:41:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:41:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:41:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:41:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:41:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:41:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:41:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:41:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:41:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:41:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:41:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:41:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:41:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:41:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 03:41:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:41:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:41:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:41:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:41:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 03:41:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 03:41:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 03:41:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 03:41:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 03:41:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 03:41:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 03:41:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:41:06,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:41:06,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258055582] [2024-11-12 03:41:06,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258055582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:41:06,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798239773] [2024-11-12 03:41:06,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:06,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:41:06,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:41:06,717 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-12 03:41:06,718 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-12 03:41:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:06,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 03:41:06,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:41:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 645 proven. 45 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-12 03:41:07,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:41:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:41:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798239773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:41:07,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:41:07,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2024-11-12 03:41:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329908247] [2024-11-12 03:41:07,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:41:07,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 03:41:07,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:41:07,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 03:41:07,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-12 03:41:07,787 INFO L87 Difference]: Start difference. First operand 312 states and 484 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2024-11-12 03:41:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:41:08,887 INFO L93 Difference]: Finished difference Result 997 states and 1526 transitions. [2024-11-12 03:41:08,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 03:41:08,888 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) Word has length 175 [2024-11-12 03:41:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:41:08,895 INFO L225 Difference]: With dead ends: 997 [2024-11-12 03:41:08,896 INFO L226 Difference]: Without dead ends: 737 [2024-11-12 03:41:08,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2024-11-12 03:41:08,898 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 847 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:41:08,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1277 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:41:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-12 03:41:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 482. [2024-11-12 03:41:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 335 states have (on average 1.3044776119402985) internal successors, (437), 338 states have internal predecessors, (437), 134 states have call successors, (134), 12 states have call predecessors, (134), 12 states have return successors, (134), 131 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-12 03:41:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 705 transitions. [2024-11-12 03:41:08,959 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 705 transitions. Word has length 175 [2024-11-12 03:41:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:41:08,959 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 705 transitions. [2024-11-12 03:41:08,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2024-11-12 03:41:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 705 transitions. [2024-11-12 03:41:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-12 03:41:08,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:08,962 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:08,980 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-12 03:41:09,163 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-12 03:41:09,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:09,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 568257959, now seen corresponding path program 1 times [2024-11-12 03:41:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:41:09,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183761300] [2024-11-12 03:41:09,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:41:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:41:09,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963231314] [2024-11-12 03:41:09,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:09,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:41:09,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:41:09,270 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-12 03:41:09,277 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-12 03:41:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:41:09,399 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:41:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:41:09,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:41:09,523 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:41:09,524 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:41:09,544 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-12 03:41:09,725 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-12 03:41:09,729 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 03:41:09,848 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:41:09,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:41:09 BoogieIcfgContainer [2024-11-12 03:41:09,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:41:09,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:41:09,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:41:09,854 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:41:09,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:41:00" (3/4) ... [2024-11-12 03:41:09,856 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:41:09,857 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:41:09,858 INFO L158 Benchmark]: Toolchain (without parser) took 10516.37ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 112.4MB in the beginning and 288.3MB in the end (delta: -175.9MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2024-11-12 03:41:09,858 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:41:09,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.45ms. Allocated memory is still 165.7MB. Free memory was 112.1MB in the beginning and 94.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:41:09,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.13ms. Allocated memory is still 165.7MB. Free memory was 94.9MB in the beginning and 89.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:41:09,859 INFO L158 Benchmark]: Boogie Preprocessor took 52.18ms. Allocated memory is still 165.7MB. Free memory was 89.9MB in the beginning and 84.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 03:41:09,859 INFO L158 Benchmark]: RCFGBuilder took 613.09ms. Allocated memory is still 165.7MB. Free memory was 84.0MB in the beginning and 52.2MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-12 03:41:09,860 INFO L158 Benchmark]: TraceAbstraction took 9461.72ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 51.8MB in the beginning and 289.4MB in the end (delta: -237.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:41:09,860 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 383.8MB. Free memory was 289.4MB in the beginning and 288.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:41:09,861 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.15ms. Allocated memory is still 165.7MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.45ms. Allocated memory is still 165.7MB. Free memory was 112.1MB in the beginning and 94.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.13ms. Allocated memory is still 165.7MB. Free memory was 94.9MB in the beginning and 89.9MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.18ms. Allocated memory is still 165.7MB. Free memory was 89.9MB in the beginning and 84.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 613.09ms. Allocated memory is still 165.7MB. Free memory was 84.0MB in the beginning and 52.2MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9461.72ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 51.8MB in the beginning and 289.4MB in the end (delta: -237.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 383.8MB. Free memory was 289.4MB in the beginning and 288.3MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] float var_1_21 = 4.2; [L41] float var_1_22 = 5.5; [L42] signed short int var_1_23 = -10; [L43] unsigned long int var_1_30 = 1000000000; [L44] unsigned long int var_1_31 = 4155847319; [L45] float var_1_33 = 99.25; [L46] signed long int var_1_34 = 10; [L47] unsigned char var_1_35 = 16; [L48] unsigned char var_1_36 = 100; [L49] signed long int var_1_39 = -128; [L50] signed long int var_1_40 = 1792665454; [L51] unsigned char last_1_var_1_8 = 1; [L52] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L183] last_1_var_1_8 = var_1_8 [L184] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=0] [L152] var_1_9 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L154] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L155] var_1_10 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L156] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L160] var_1_13 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L161] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L162] var_1_15 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L163] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L164] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L172] var_1_31 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_31 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L173] RET assume_abort_if_not(var_1_31 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_31 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_31 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L175] var_1_36 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L177] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L177] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L178] var_1_40 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L180] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L195] RET updateVariables() [L196] CALL step() [L56] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L57] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=1, var_1_8=1, var_1_9=1] [L58] COND TRUE \read(last_1_var_1_8) [L59] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L64] COND TRUE var_1_5 < var_1_3 [L65] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L69] COND TRUE \read(var_1_8) [L70] var_1_34 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] COND FALSE !(var_1_1 > (var_1_1 >> var_1_5)) [L79] var_1_39 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L81] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L82] COND FALSE !(128u <= var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L97] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L102] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L105] COND TRUE var_1_31 > var_1_1 [L106] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L114] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L115] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L116] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L120] var_1_20 = ((((var_1_21) < (var_1_22)) ? (var_1_21) : (var_1_22))) [L121] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L122] COND TRUE var_1_4 == stepLocal_1 [L123] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L125] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L126] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L126] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L127] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L187-L188] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=1, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1491 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1480 mSDsluCounter, 2881 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2084 mSDsCounter, 482 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2365 IncrementalHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 482 mSolverCounterUnsat, 797 mSDtfsCounter, 2365 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 700 GetRequests, 641 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=482occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 309 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1398 NumberOfCodeBlocks, 1398 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1216 ConstructedInterpolants, 0 QuantifiedInterpolants, 4269 SizeOfPredicates, 5 NumberOfNonLiveVariables, 407 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 8965/9100 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-12 03:41:09,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.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 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:41:12,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:41:12,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:41:12,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:41:12,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:41:12,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:41:12,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:41:12,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:41:12,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:41:12,144 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:41:12,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:41:12,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:41:12,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:41:12,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:41:12,145 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:41:12,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:41:12,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:41:12,148 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:41:12,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:41:12,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:41:12,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:41:12,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:41:12,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:41:12,152 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:41:12,152 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:41:12,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:41:12,153 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:41:12,153 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:41:12,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:41:12,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:41:12,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:41:12,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:41:12,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:41:12,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:41:12,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:41:12,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:41:12,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:41:12,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:41:12,156 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:41:12,156 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:41:12,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:41:12,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:41:12,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:41:12,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:41:12,158 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 -> 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a [2024-11-12 03:41:12,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:41:12,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:41:12,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:41:12,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:41:12,462 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:41:12,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-12 03:41:14,149 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:41:14,457 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:41:14,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-12 03:41:14,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31388edcd/552706c29d514853825ea567357c1bbd/FLAGb3300fc16 [2024-11-12 03:41:14,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31388edcd/552706c29d514853825ea567357c1bbd [2024-11-12 03:41:14,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:41:14,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:41:14,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:41:14,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:41:14,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:41:14,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:41:14" (1/1) ... [2024-11-12 03:41:14,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e7fa4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:14, skipping insertion in model container [2024-11-12 03:41:14,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:41:14" (1/1) ... [2024-11-12 03:41:14,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:41:15,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-11-12 03:41:15,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:41:15,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:41:15,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-11-12 03:41:15,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:41:15,488 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:41:15,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15 WrapperNode [2024-11-12 03:41:15,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:41:15,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:41:15,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:41:15,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:41:15,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,604 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-12 03:41:15,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:41:15,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:41:15,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:41:15,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:41:15,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,644 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-12 03:41:15,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:41:15,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:41:15,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:41:15,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:41:15,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (1/1) ... [2024-11-12 03:41:15,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:41:15,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:41:15,724 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-12 03:41:15,738 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-12 03:41:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:41:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:41:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:41:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:41:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:41:15,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:41:15,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:41:15,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:41:16,560 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 03:41:16,561 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:41:16,573 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:41:16,573 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:41:16,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:41:16 BoogieIcfgContainer [2024-11-12 03:41:16,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:41:16,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:41:16,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:41:16,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:41:16,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:41:14" (1/3) ... [2024-11-12 03:41:16,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424bb2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:41:16, skipping insertion in model container [2024-11-12 03:41:16,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:41:15" (2/3) ... [2024-11-12 03:41:16,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424bb2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:41:16, skipping insertion in model container [2024-11-12 03:41:16,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:41:16" (3/3) ... [2024-11-12 03:41:16,583 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-11-12 03:41:16,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:41:16,596 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:41:16,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:41:16,665 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;@776b4a07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:41:16,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:41:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:41:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 03:41:16,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:16,685 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:16,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:16,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2003112969, now seen corresponding path program 1 times [2024-11-12 03:41:16,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:41:16,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013045273] [2024-11-12 03:41:16,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:16,705 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-12 03:41:16,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:41:16,710 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-12 03:41:16,715 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-12 03:41:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:16,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:41:16,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:41:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-12 03:41:17,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:41:17,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:41:17,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013045273] [2024-11-12 03:41:17,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013045273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:41:17,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:41:17,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:41:17,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590426456] [2024-11-12 03:41:17,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:41:17,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:41:17,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:41:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:41:17,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:41:17,052 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:41:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:41:17,073 INFO L93 Difference]: Finished difference Result 163 states and 288 transitions. [2024-11-12 03:41:17,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:41:17,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-11-12 03:41:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:41:17,083 INFO L225 Difference]: With dead ends: 163 [2024-11-12 03:41:17,084 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 03:41:17,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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-12 03:41:17,089 INFO L435 NwaCegarLoop]: 127 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, 127 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-12 03:41:17,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:41:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 03:41:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 03:41:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 53 states have internal predecessors, (75), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 03:41:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2024-11-12 03:41:17,123 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 169 [2024-11-12 03:41:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:41:17,123 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2024-11-12 03:41:17,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 03:41:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2024-11-12 03:41:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 03:41:17,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:17,126 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:17,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 03:41:17,330 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-12 03:41:17,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:17,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:17,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1737596881, now seen corresponding path program 1 times [2024-11-12 03:41:17,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:41:17,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534237025] [2024-11-12 03:41:17,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:17,333 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-12 03:41:17,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:41:17,336 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-12 03:41:17,338 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-12 03:41:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:17,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 03:41:17,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:41:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 03:41:17,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:41:17,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:41:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534237025] [2024-11-12 03:41:17,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534237025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:41:17,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:41:17,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:41:17,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755902964] [2024-11-12 03:41:17,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:41:17,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:41:17,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:41:17,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:41:17,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:41:17,994 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:41:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:41:18,512 INFO L93 Difference]: Finished difference Result 238 states and 376 transitions. [2024-11-12 03:41:18,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:41:18,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-11-12 03:41:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:41:18,526 INFO L225 Difference]: With dead ends: 238 [2024-11-12 03:41:18,527 INFO L226 Difference]: Without dead ends: 160 [2024-11-12 03:41:18,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:41:18,528 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 74 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:41:18,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 414 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 03:41:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-12 03:41:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2024-11-12 03:41:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 75 states have internal predecessors, (97), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 03:41:18,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 201 transitions. [2024-11-12 03:41:18,586 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 201 transitions. Word has length 169 [2024-11-12 03:41:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:41:18,586 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 201 transitions. [2024-11-12 03:41:18,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 03:41:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 201 transitions. [2024-11-12 03:41:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-12 03:41:18,596 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:18,597 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:18,605 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-12 03:41:18,797 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-12 03:41:18,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:18,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash 137762340, now seen corresponding path program 1 times [2024-11-12 03:41:18,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:41:18,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035182542] [2024-11-12 03:41:18,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:18,799 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-12 03:41:18,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:41:18,805 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-12 03:41:18,807 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-12 03:41:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:18,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 03:41:18,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:41:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 645 proven. 45 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-12 03:41:19,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:41:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-12 03:41:20,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:41:20,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035182542] [2024-11-12 03:41:20,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035182542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:41:20,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:41:20,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-11-12 03:41:20,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880277549] [2024-11-12 03:41:20,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:41:20,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 03:41:20,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:41:20,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 03:41:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:41:20,048 INFO L87 Difference]: Start difference. First operand 130 states and 201 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-12 03:41:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:41:23,052 INFO L93 Difference]: Finished difference Result 628 states and 981 transitions. [2024-11-12 03:41:23,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 03:41:23,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 170 [2024-11-12 03:41:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:41:23,058 INFO L225 Difference]: With dead ends: 628 [2024-11-12 03:41:23,058 INFO L226 Difference]: Without dead ends: 550 [2024-11-12 03:41:23,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=502, Unknown=0, NotChecked=0, Total=756 [2024-11-12 03:41:23,061 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1144 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-12 03:41:23,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 611 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-12 03:41:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-12 03:41:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 377. [2024-11-12 03:41:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 255 states have (on average 1.4039215686274509) internal successors, (358), 257 states have internal predecessors, (358), 114 states have call successors, (114), 7 states have call predecessors, (114), 7 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2024-11-12 03:41:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 586 transitions. [2024-11-12 03:41:23,154 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 586 transitions. Word has length 170 [2024-11-12 03:41:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:41:23,155 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 586 transitions. [2024-11-12 03:41:23,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-12 03:41:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 586 transitions. [2024-11-12 03:41:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-12 03:41:23,157 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:41:23,157 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:41:23,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 03:41:23,357 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-12 03:41:23,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:41:23,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:41:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1726110242, now seen corresponding path program 1 times [2024-11-12 03:41:23,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:41:23,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433937354] [2024-11-12 03:41:23,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:41:23,360 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-12 03:41:23,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:41:23,363 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-12 03:41:23,364 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-12 03:41:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:41:23,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 03:41:23,521 INFO L279 TraceCheckSpWp]: Computing forward predicates...