./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_loopvsstraightlinecode_50-1loop_file-79.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 cd8885ac41c62f773245cba90ab11a911b6bfaa88e51237315a4bb24a1d31893 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:07:27,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:07:27,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:07:27,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:07:27,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:07:27,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:07:27,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:07:27,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:07:27,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:07:27,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:07:27,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:07:27,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:07:27,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:07:27,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:07:27,919 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:07:27,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:07:27,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:07:27,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:07:27,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:07:27,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:07:27,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:07:27,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:07:27,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:07:27,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:07:27,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:07:27,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:07:27,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:07:27,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:07:27,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:07:27,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:07:27,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:07:27,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:07:27,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:07:27,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:07:27,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:07:27,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:07:27,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:07:27,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:07:27,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:07:27,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:07:27,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:07:27,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:07:27,930 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 -> cd8885ac41c62f773245cba90ab11a911b6bfaa88e51237315a4bb24a1d31893 [2024-11-09 00:07:28,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:07:28,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:07:28,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:07:28,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:07:28,201 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:07:28,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-09 00:07:29,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:07:29,860 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:07:29,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-09 00:07:29,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ecd02a94/acb6eaedf7e14e15ba258ee84aeb4583/FLAG1cc91b2c0 [2024-11-09 00:07:30,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ecd02a94/acb6eaedf7e14e15ba258ee84aeb4583 [2024-11-09 00:07:30,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:07:30,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:07:30,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:07:30,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:07:30,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:07:30,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8b1ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30, skipping insertion in model container [2024-11-09 00:07:30,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:07:30,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i[915,928] [2024-11-09 00:07:30,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:07:30,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:07:30,535 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i[915,928] [2024-11-09 00:07:30,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:07:30,610 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:07:30,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30 WrapperNode [2024-11-09 00:07:30,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:07:30,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:07:30,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:07:30,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:07:30,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,678 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-09 00:07:30,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:07:30,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:07:30,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:07:30,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:07:30,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,728 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-09 00:07:30,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:07:30,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:07:30,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:07:30,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:07:30,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (1/1) ... [2024-11-09 00:07:30,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:07:30,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:07:30,803 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-09 00:07:30,806 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-09 00:07:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:07:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:07:30,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:07:30,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:07:30,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:07:30,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:07:30,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:07:30,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:07:31,198 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-09 00:07:31,198 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:07:31,213 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:07:31,214 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:07:31,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:07:31 BoogieIcfgContainer [2024-11-09 00:07:31,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:07:31,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:07:31,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:07:31,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:07:31,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:07:30" (1/3) ... [2024-11-09 00:07:31,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa876f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:07:31, skipping insertion in model container [2024-11-09 00:07:31,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:30" (2/3) ... [2024-11-09 00:07:31,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa876f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:07:31, skipping insertion in model container [2024-11-09 00:07:31,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:07:31" (3/3) ... [2024-11-09 00:07:31,226 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-09 00:07:31,243 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:07:31,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:07:31,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:07:31,308 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;@f9dcbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:07:31,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:07:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:07:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:07:31,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:07:31,325 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:31,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:07:31,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:07:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1641169731, now seen corresponding path program 1 times [2024-11-09 00:07:31,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:07:31,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850660159] [2024-11-09 00:07:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:31,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:07:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:07:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:07:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:07:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:07:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:07:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:07:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:07:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:07:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:07:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:07:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:07:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:07:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 00:07:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 00:07:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 00:07:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 00:07:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 00:07:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 00:07:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 00:07:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 00:07:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:07:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 00:07:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:07:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 00:07:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:07:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-09 00:07:31,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:07:31,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850660159] [2024-11-09 00:07:31,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850660159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:07:31,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:07:31,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:07:31,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619374957] [2024-11-09 00:07:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:07:31,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:07:31,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:07:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:07:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:07:31,851 INFO L87 Difference]: Start difference. First operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:07:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:07:31,909 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2024-11-09 00:07:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:07:31,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157 [2024-11-09 00:07:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:07:31,918 INFO L225 Difference]: With dead ends: 141 [2024-11-09 00:07:31,919 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 00:07:31,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-09 00:07:31,940 INFO L432 NwaCegarLoop]: 106 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, 106 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-09 00:07:31,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:07:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 00:07:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-09 00:07:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:07:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-11-09 00:07:32,032 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 157 [2024-11-09 00:07:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:07:32,036 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-11-09 00:07:32,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:07:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-11-09 00:07:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:07:32,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:07:32,043 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:32,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:07:32,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:07:32,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:07:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1857591947, now seen corresponding path program 1 times [2024-11-09 00:07:32,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:07:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434155742] [2024-11-09 00:07:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:07:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:07:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:07:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:07:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:07:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:07:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:07:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:07:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:07:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:07:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:07:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:07:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:07:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 00:07:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 00:07:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 00:07:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 00:07:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 00:07:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 00:07:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 00:07:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 00:07:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:07:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 00:07:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:07:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 00:07:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:07:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-09 00:07:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:07:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434155742] [2024-11-09 00:07:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434155742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:07:32,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:07:32,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:07:32,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274077043] [2024-11-09 00:07:32,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:07:32,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:07:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:07:32,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:07:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:07:32,517 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:07:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:07:32,566 INFO L93 Difference]: Finished difference Result 198 states and 300 transitions. [2024-11-09 00:07:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:07:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157 [2024-11-09 00:07:32,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:07:32,569 INFO L225 Difference]: With dead ends: 198 [2024-11-09 00:07:32,569 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 00:07:32,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-09 00:07:32,571 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 48 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:07:32,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 199 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:07:32,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 00:07:32,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-09 00:07:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 00:07:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-11-09 00:07:32,611 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 157 [2024-11-09 00:07:32,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:07:32,611 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-11-09 00:07:32,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:07:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-11-09 00:07:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 00:07:32,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:07:32,615 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:32,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:07:32,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:07:32,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:07:32,616 INFO L85 PathProgramCache]: Analyzing trace with hash 641584241, now seen corresponding path program 1 times [2024-11-09 00:07:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:07:32,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69695696] [2024-11-09 00:07:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:32,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:07:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:07:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:07:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:07:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:07:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:07:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:07:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:07:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:07:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:07:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:07:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:07:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:07:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 00:07:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 00:07:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 00:07:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 00:07:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 00:07:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 00:07:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 00:07:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 00:07:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:07:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 00:07:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:07:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 00:07:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:07:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-09 00:07:33,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:07:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69695696] [2024-11-09 00:07:33,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69695696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:07:33,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:07:33,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:07:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850689209] [2024-11-09 00:07:33,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:07:33,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:07:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:07:33,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:07:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:07:33,116 INFO L87 Difference]: Start difference. First operand 131 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:07:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:07:33,286 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2024-11-09 00:07:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:07:33,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 158 [2024-11-09 00:07:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:07:33,292 INFO L225 Difference]: With dead ends: 276 [2024-11-09 00:07:33,292 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 00:07:33,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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-09 00:07:33,294 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 86 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:07:33,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 344 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:07:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 00:07:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2024-11-09 00:07:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 00:07:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-11-09 00:07:33,318 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 158 [2024-11-09 00:07:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:07:33,319 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-11-09 00:07:33,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:07:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-11-09 00:07:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:07:33,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:07:33,321 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:33,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:07:33,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:07:33,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:07:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1646093457, now seen corresponding path program 1 times [2024-11-09 00:07:33,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:07:33,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9795898] [2024-11-09 00:07:33,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:07:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:07:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:07:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:07:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:07:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:07:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:07:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:07:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:07:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:07:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:07:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:07:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:07:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 00:07:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 00:07:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 00:07:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 00:07:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 00:07:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 00:07:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 00:07:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 00:07:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:07:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 00:07:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:07:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 00:07:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:07:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-09 00:07:33,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:07:33,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9795898] [2024-11-09 00:07:33,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9795898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:07:33,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:07:33,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:07:33,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944170856] [2024-11-09 00:07:33,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:07:33,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:07:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:07:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:07:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:07:33,585 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:07:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:07:33,622 INFO L93 Difference]: Finished difference Result 275 states and 409 transitions. [2024-11-09 00:07:33,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:07:33,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2024-11-09 00:07:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:07:33,625 INFO L225 Difference]: With dead ends: 275 [2024-11-09 00:07:33,625 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 00:07:33,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-09 00:07:33,631 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 33 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:07:33,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 183 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:07:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 00:07:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-09 00:07:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 88 states have internal predecessors, (104), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 00:07:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-09 00:07:33,668 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 159 [2024-11-09 00:07:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:07:33,670 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-09 00:07:33,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:07:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-09 00:07:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:07:33,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:07:33,673 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:33,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:07:33,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:07:33,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:07:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1427163110, now seen corresponding path program 1 times [2024-11-09 00:07:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:07:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748296311] [2024-11-09 00:07:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:33,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:07:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:07:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:07:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:07:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:07:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:07:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:07:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:07:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:07:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 00:07:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:07:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:07:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:07:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 00:07:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 00:07:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 00:07:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 00:07:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 00:07:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 00:07:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 00:07:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 00:07:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 00:07:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 00:07:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 00:07:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 00:07:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 00:07:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-09 00:07:34,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:07:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748296311] [2024-11-09 00:07:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748296311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:07:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926771115] [2024-11-09 00:07:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:34,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:07:34,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:07:34,170 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-09 00:07:34,171 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-09 00:07:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:34,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 00:07:34,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:07:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-11-09 00:07:34,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:07:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-09 00:07:35,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926771115] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:07:35,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:07:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2024-11-09 00:07:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979778026] [2024-11-09 00:07:35,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:07:35,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 00:07:35,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:07:35,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 00:07:35,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:07:35,199 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) [2024-11-09 00:07:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:07:35,629 INFO L93 Difference]: Finished difference Result 235 states and 331 transitions. [2024-11-09 00:07:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 00:07:35,630 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) Word has length 160 [2024-11-09 00:07:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:07:35,633 INFO L225 Difference]: With dead ends: 235 [2024-11-09 00:07:35,634 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 00:07:35,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2024-11-09 00:07:35,635 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 207 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:07:35,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 184 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:07:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 00:07:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2024-11-09 00:07:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 93 states have (on average 1.1505376344086022) internal successors, (107), 94 states have internal predecessors, (107), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 00:07:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 215 transitions. [2024-11-09 00:07:35,660 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 215 transitions. Word has length 160 [2024-11-09 00:07:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:07:35,661 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 215 transitions. [2024-11-09 00:07:35,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 17 states have internal predecessors, (94), 5 states have call successors, (60), 3 states have call predecessors, (60), 6 states have return successors, (61), 5 states have call predecessors, (61), 5 states have call successors, (61) [2024-11-09 00:07:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 215 transitions. [2024-11-09 00:07:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:07:35,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:07:35,663 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:35,685 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-09 00:07:35,867 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-09 00:07:35,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:07:35,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:07:35,869 INFO L85 PathProgramCache]: Analyzing trace with hash 166909329, now seen corresponding path program 1 times [2024-11-09 00:07:35,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:07:35,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080218978] [2024-11-09 00:07:35,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:35,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:07:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:07:35,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672188078] [2024-11-09 00:07:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:35,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:07:35,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:07:35,953 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-09 00:07:35,954 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-09 00:07:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:07:36,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:07:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:07:36,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:07:36,611 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:07:36,612 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:07:36,639 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-09 00:07:36,814 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-09 00:07:36,818 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 00:07:36,914 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:07:36,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:07:36 BoogieIcfgContainer [2024-11-09 00:07:36,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:07:36,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:07:36,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:07:36,917 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:07:36,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:07:31" (3/4) ... [2024-11-09 00:07:36,920 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:07:36,921 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:07:36,921 INFO L158 Benchmark]: Toolchain (without parser) took 6694.90ms. Allocated memory was 151.0MB in the beginning and 243.3MB in the end (delta: 92.3MB). Free memory was 78.5MB in the beginning and 162.9MB in the end (delta: -84.4MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-09 00:07:36,921 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 151.0MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:07:36,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.54ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 78.2MB in the beginning and 167.0MB in the end (delta: -88.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-09 00:07:36,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.19ms. Allocated memory is still 197.1MB. Free memory was 167.0MB in the beginning and 161.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:07:36,924 INFO L158 Benchmark]: Boogie Preprocessor took 84.37ms. Allocated memory is still 197.1MB. Free memory was 161.8MB in the beginning and 154.4MB in the end (delta: 7.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:07:36,924 INFO L158 Benchmark]: RCFGBuilder took 449.62ms. Allocated memory is still 197.1MB. Free memory was 154.4MB in the beginning and 130.1MB in the end (delta: 24.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 00:07:36,924 INFO L158 Benchmark]: TraceAbstraction took 5699.64ms. Allocated memory was 197.1MB in the beginning and 243.3MB in the end (delta: 46.1MB). Free memory was 129.3MB in the beginning and 162.9MB in the end (delta: -33.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-09 00:07:36,925 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 243.3MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:07:36,927 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.34ms. Allocated memory is still 151.0MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.54ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 78.2MB in the beginning and 167.0MB in the end (delta: -88.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.19ms. Allocated memory is still 197.1MB. Free memory was 167.0MB in the beginning and 161.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.37ms. Allocated memory is still 197.1MB. Free memory was 161.8MB in the beginning and 154.4MB in the end (delta: 7.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 449.62ms. Allocated memory is still 197.1MB. Free memory was 154.4MB in the beginning and 130.1MB in the end (delta: 24.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5699.64ms. Allocated memory was 197.1MB in the beginning and 243.3MB in the end (delta: 46.1MB). Free memory was 129.3MB in the beginning and 162.9MB in the end (delta: -33.7MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 243.3MB. Free memory is still 162.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 145. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned char last_1_var_1_18 = 1; [L47] unsigned char last_1_var_1_20 = 100; VAL [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L149] isInitial = 1 [L150] FCALL initially() [L151] int k_loop; [L152] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L152] COND TRUE k_loop < 1 [L153] CALL updateLastVariables() [L141] last_1_var_1_18 = var_1_18 [L142] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L153] RET updateLastVariables() [L154] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L99] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L100] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L100] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L101] var_1_3 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L102] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L103] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L103] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L104] var_1_8 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L105] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L106] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L106] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L107] var_1_10 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L108] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L109] var_1_11 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L110] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L111] var_1_13 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L112] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L113] var_1_14 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L114] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L115] var_1_15 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L116] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L117] var_1_16 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L118] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L119] var_1_17 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L120] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L121] var_1_19 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L122] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L124] var_1_21 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L125] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L126] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L126] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L127] var_1_22 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L128] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L130] var_1_23 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L131] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L133] var_1_24 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L134] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L136] var_1_25 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L137] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L138] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L138] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L154] RET updateVariables() [L155] CALL step() [L51] signed long int stepLocal_1 = last_1_var_1_20; [L52] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L53] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L54] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L57] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L62] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=84/5, var_1_27=64, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L67] var_1_26 = var_1_16 [L68] var_1_27 = 10u [L69] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L70] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L71] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L75] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L76] COND TRUE var_1_15 >= var_1_26 [L77] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=253, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L84] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=253, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L85] COND FALSE !(! var_1_18) [L88] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=-2, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=253, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L93] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L94] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=506, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=253, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L155] RET step() [L156] CALL, EXPR property() [L145-L146] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; VAL [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=506, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=253, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L156] RET, EXPR property() [L156] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=506, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=253, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=3, var_1_11=0, var_1_12=506, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=253, var_1_21=766, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=10, var_1_2=1, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 374 mSDsluCounter, 1016 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 523 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 493 mSDtfsCounter, 310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 595 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1271 NumberOfCodeBlocks, 1271 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1104 ConstructedInterpolants, 0 QuantifiedInterpolants, 2397 SizeOfPredicates, 4 NumberOfNonLiveVariables, 371 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 8310/8400 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-09 00:07:36,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_50-1loop_file-79.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 cd8885ac41c62f773245cba90ab11a911b6bfaa88e51237315a4bb24a1d31893 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:07:39,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:07:39,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:07:39,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:07:39,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:07:39,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:07:39,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:07:39,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:07:39,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:07:39,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:07:39,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:07:39,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:07:39,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:07:39,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:07:39,379 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:07:39,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:07:39,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:07:39,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:07:39,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:07:39,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:07:39,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:07:39,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:07:39,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:07:39,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:07:39,385 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:07:39,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:07:39,385 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:07:39,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:07:39,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:07:39,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:07:39,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:07:39,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:07:39,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:07:39,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:07:39,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:07:39,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:07:39,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:07:39,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:07:39,387 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:07:39,387 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:07:39,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:07:39,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:07:39,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:07:39,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:07:39,390 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 -> cd8885ac41c62f773245cba90ab11a911b6bfaa88e51237315a4bb24a1d31893 [2024-11-09 00:07:39,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:07:39,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:07:39,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:07:39,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:07:39,739 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:07:39,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-09 00:07:41,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:07:41,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:07:41,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-09 00:07:41,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d176354/d257acb1e74c43728e68c4debbdfcf3a/FLAGa90db7cdc [2024-11-09 00:07:41,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52d176354/d257acb1e74c43728e68c4debbdfcf3a [2024-11-09 00:07:41,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:07:41,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:07:41,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:07:41,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:07:41,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:07:41,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:07:41" (1/1) ... [2024-11-09 00:07:41,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3341f868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:41, skipping insertion in model container [2024-11-09 00:07:41,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:07:41" (1/1) ... [2024-11-09 00:07:41,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:07:41,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i[915,928] [2024-11-09 00:07:41,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:07:41,947 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:07:41,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i[915,928] [2024-11-09 00:07:42,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:07:42,031 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:07:42,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42 WrapperNode [2024-11-09 00:07:42,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:07:42,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:07:42,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:07:42,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:07:42,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,082 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-09 00:07:42,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:07:42,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:07:42,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:07:42,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:07:42,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,126 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-09 00:07:42,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:07:42,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:07:42,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:07:42,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:07:42,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (1/1) ... [2024-11-09 00:07:42,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:07:42,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:07:42,189 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-09 00:07:42,194 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-09 00:07:42,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:07:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:07:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:07:42,240 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:07:42,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:07:42,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:07:42,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:07:42,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:07:52,926 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-09 00:07:52,926 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:07:52,942 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:07:52,943 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:07:52,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:07:52 BoogieIcfgContainer [2024-11-09 00:07:52,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:07:52,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:07:52,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:07:52,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:07:52,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:07:41" (1/3) ... [2024-11-09 00:07:52,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c1fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:07:52, skipping insertion in model container [2024-11-09 00:07:52,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:07:42" (2/3) ... [2024-11-09 00:07:52,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776c1fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:07:52, skipping insertion in model container [2024-11-09 00:07:52,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:07:52" (3/3) ... [2024-11-09 00:07:52,953 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-09 00:07:52,972 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:07:52,972 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:07:53,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:07:53,044 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;@1bf988c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:07:53,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:07:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:07:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:07:53,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:07:53,068 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:53,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:07:53,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:07:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1641169731, now seen corresponding path program 1 times [2024-11-09 00:07:53,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:07:53,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932331077] [2024-11-09 00:07:53,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:53,099 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-09 00:07:53,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:07:53,103 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-09 00:07:53,128 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-09 00:07:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:53,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:07:53,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:07:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-09 00:07:53,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:07:53,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:07:53,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932331077] [2024-11-09 00:07:53,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932331077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:07:53,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:07:53,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:07:53,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302314716] [2024-11-09 00:07:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:07:53,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:07:53,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:07:53,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:07:53,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:07:53,679 INFO L87 Difference]: Start difference. First operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:07:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:07:53,706 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2024-11-09 00:07:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:07:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 157 [2024-11-09 00:07:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:07:53,715 INFO L225 Difference]: With dead ends: 141 [2024-11-09 00:07:53,715 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 00:07:53,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:07:53,722 INFO L432 NwaCegarLoop]: 106 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, 106 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-09 00:07:53,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:07:53,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 00:07:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-09 00:07:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:07:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-11-09 00:07:53,768 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 157 [2024-11-09 00:07:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:07:53,768 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-11-09 00:07:53,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-09 00:07:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-11-09 00:07:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:07:53,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:07:53,777 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:07:53,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:07:53,978 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-09 00:07:53,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:07:53,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:07:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1857591947, now seen corresponding path program 1 times [2024-11-09 00:07:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:07:53,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091504798] [2024-11-09 00:07:53,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:07:53,980 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-09 00:07:53,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:07:53,983 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-09 00:07:53,984 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-09 00:07:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:07:54,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 00:07:54,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:07:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-09 00:07:55,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:07:55,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:07:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091504798] [2024-11-09 00:07:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091504798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:07:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:07:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:07:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679169030] [2024-11-09 00:07:55,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:07:55,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:07:55,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:07:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:07:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:07:55,925 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:08:00,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:08:03,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:08:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:03,630 INFO L93 Difference]: Finished difference Result 213 states and 321 transitions. [2024-11-09 00:08:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:08:03,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 157 [2024-11-09 00:08:03,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:03,633 INFO L225 Difference]: With dead ends: 213 [2024-11-09 00:08:03,633 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 00:08:03,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:08:03,635 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 83 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:03,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 344 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-11-09 00:08:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 00:08:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2024-11-09 00:08:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 00:08:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-11-09 00:08:03,670 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 157 [2024-11-09 00:08:03,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:03,670 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-11-09 00:08:03,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:08:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-11-09 00:08:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-09 00:08:03,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:03,673 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:08:03,686 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-09 00:08:03,873 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-09 00:08:03,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:03,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:03,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1646093457, now seen corresponding path program 1 times [2024-11-09 00:08:03,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:08:03,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494866239] [2024-11-09 00:08:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:03,876 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-09 00:08:03,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:08:03,877 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-09 00:08:03,879 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-09 00:08:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:04,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 00:08:04,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:08:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-09 00:08:04,322 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:08:04,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:08:04,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494866239] [2024-11-09 00:08:04,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494866239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:08:04,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:08:04,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:08:04,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106015042] [2024-11-09 00:08:04,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:08:04,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:08:04,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:08:04,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:08:04,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:08:04,324 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:08:08,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:08:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:08,564 INFO L93 Difference]: Finished difference Result 275 states and 409 transitions. [2024-11-09 00:08:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:08:08,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 159 [2024-11-09 00:08:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:08,567 INFO L225 Difference]: With dead ends: 275 [2024-11-09 00:08:08,567 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 00:08:08,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 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-09 00:08:08,570 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 33 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:08,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 182 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 00:08:08,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 00:08:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-09 00:08:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 88 states have internal predecessors, (104), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 00:08:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-09 00:08:08,609 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 159 [2024-11-09 00:08:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:08,610 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-09 00:08:08,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-09 00:08:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-09 00:08:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:08:08,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:08,619 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:08:08,649 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-09 00:08:08,820 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-09 00:08:08,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:08,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1427163110, now seen corresponding path program 1 times [2024-11-09 00:08:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:08:08,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883452632] [2024-11-09 00:08:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:08,822 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-09 00:08:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:08:08,826 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-09 00:08:08,827 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-09 00:08:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:09,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 00:08:09,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:08:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-11-09 00:08:09,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:08:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-09 00:08:10,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:08:10,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883452632] [2024-11-09 00:08:10,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883452632] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:08:10,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:08:10,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-09 00:08:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40981831] [2024-11-09 00:08:10,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:08:10,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:08:10,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:08:10,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:08:10,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:08:10,681 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-09 00:08:15,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:08:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:15,842 INFO L93 Difference]: Finished difference Result 235 states and 331 transitions. [2024-11-09 00:08:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 00:08:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 160 [2024-11-09 00:08:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:15,882 INFO L225 Difference]: With dead ends: 235 [2024-11-09 00:08:15,882 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 00:08:15,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:08:15,883 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 175 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:15,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 150 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-09 00:08:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 00:08:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2024-11-09 00:08:15,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 94 states have internal predecessors, (108), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 00:08:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 216 transitions. [2024-11-09 00:08:15,902 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 216 transitions. Word has length 160 [2024-11-09 00:08:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:15,903 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 216 transitions. [2024-11-09 00:08:15,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-09 00:08:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 216 transitions. [2024-11-09 00:08:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 00:08:15,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:15,905 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:08:15,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 00:08:16,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:08:16,107 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash 166909329, now seen corresponding path program 1 times [2024-11-09 00:08:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:08:16,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053779851] [2024-11-09 00:08:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:16,109 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-09 00:08:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:08:16,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:08:16,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 00:08:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:16,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 00:08:16,524 INFO L278 TraceCheckSpWp]: Computing forward predicates...