./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_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-wip.dd.update-z3-fca748b-m [2024-11-20 07:00:32,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:00:32,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:00:32,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:00:32,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:00:32,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:00:32,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:00:32,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:00:32,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:00:32,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:00:32,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:00:32,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:00:32,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:00:32,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:00:32,779 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:00:32,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:00:32,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:00:32,781 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:00:32,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:00:32,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:00:32,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:00:32,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:00:32,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:00:32,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:00:32,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:00:32,784 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:00:32,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:00:32,784 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:00:32,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:00:32,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:00:32,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:00:32,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:00:32,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:00:32,787 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:00:32,787 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:00:32,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:00:32,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:00:32,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:00:32,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:00:32,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:00:32,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:00:32,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:00:32,789 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-20 07:00:33,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:00:33,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:00:33,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:00:33,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:00:33,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:00:33,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-20 07:00:34,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:00:34,647 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:00:34,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-20 07:00:34,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb31264bc/31bf534d659c4af1b56d8f28ab215490/FLAG85e28ca39 [2024-11-20 07:00:34,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb31264bc/31bf534d659c4af1b56d8f28ab215490 [2024-11-20 07:00:34,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:00:34,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:00:34,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:00:34,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:00:34,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:00:34,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:00:34" (1/1) ... [2024-11-20 07:00:34,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ad2faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:34, skipping insertion in model container [2024-11-20 07:00:34,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:00:34" (1/1) ... [2024-11-20 07:00:34,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:00:34,901 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-20 07:00:34,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:00:35,001 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:00:35,019 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-20 07:00:35,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:00:35,104 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:00:35,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35 WrapperNode [2024-11-20 07:00:35,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:00:35,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:00:35,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:00:35,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:00:35,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,172 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-20 07:00:35,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:00:35,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:00:35,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:00:35,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:00:35,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:00:35,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:00:35,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:00:35,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:00:35,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:00:35,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (1/1) ... [2024-11-20 07:00:35,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:00:35,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:00:35,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:00:35,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:00:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:00:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:00:35,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:00:35,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:00:35,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:00:35,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:00:35,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:00:35,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:00:35,766 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 07:00:35,767 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:00:35,784 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:00:35,785 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:00:35,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:35 BoogieIcfgContainer [2024-11-20 07:00:35,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:00:35,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:00:35,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:00:35,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:00:35,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:00:34" (1/3) ... [2024-11-20 07:00:35,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e615b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:00:35, skipping insertion in model container [2024-11-20 07:00:35,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:35" (2/3) ... [2024-11-20 07:00:35,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e615b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:00:35, skipping insertion in model container [2024-11-20 07:00:35,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:35" (3/3) ... [2024-11-20 07:00:35,793 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-20 07:00:35,805 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:00:35,806 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:00:35,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:00:35,866 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;@77a66560, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:00:35,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:00:35,870 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-20 07:00:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 07:00:35,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:00:35,886 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-20 07:00:35,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:00:35,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:00:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1641169731, now seen corresponding path program 1 times [2024-11-20 07:00:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:00:35,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862016589] [2024-11-20 07:00:35,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:35,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:00:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:00:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:00:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:00:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:00:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:00:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:00:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:00:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:00:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 07:00:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 07:00:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:00:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:00:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 07:00:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 07:00:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 07:00:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 07:00:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 07:00:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 07:00:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 07:00:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 07:00:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 07:00:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 07:00:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 07:00:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 07:00:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 07:00:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:36,405 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-20 07:00:36,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:00:36,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862016589] [2024-11-20 07:00:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862016589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:00:36,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:00:36,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:00:36,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828056618] [2024-11-20 07:00:36,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:00:36,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:00:36,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:00:36,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:00:36,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:00:36,439 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-20 07:00:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:00:36,469 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2024-11-20 07:00:36,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:00:36,473 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-20 07:00:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:00:36,481 INFO L225 Difference]: With dead ends: 141 [2024-11-20 07:00:36,481 INFO L226 Difference]: Without dead ends: 68 [2024-11-20 07:00:36,485 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-20 07:00:36,488 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-20 07:00:36,490 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-20 07:00:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-20 07:00:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-20 07:00:36,537 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-20 07:00:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-11-20 07:00:36,544 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 157 [2024-11-20 07:00:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:00:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-11-20 07:00:36,549 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-20 07:00:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-11-20 07:00:36,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 07:00:36,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:00:36,557 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-20 07:00:36,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:00:36,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:00:36,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:00:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1857591947, now seen corresponding path program 1 times [2024-11-20 07:00:36,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:00:36,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951257159] [2024-11-20 07:00:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:00:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:00:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:00:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:00:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:00:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:00:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:00:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:00:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:00:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 07:00:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 07:00:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:00:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:00:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 07:00:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 07:00:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 07:00:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 07:00:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 07:00:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 07:00:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 07:00:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 07:00:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 07:00:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 07:00:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 07:00:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 07:00:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 07:00:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,187 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-20 07:00:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:00:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951257159] [2024-11-20 07:00:37,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951257159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:00:37,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:00:37,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:00:37,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216569377] [2024-11-20 07:00:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:00:37,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:00:37,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:00:37,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:00:37,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:00:37,191 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-20 07:00:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:00:37,250 INFO L93 Difference]: Finished difference Result 198 states and 300 transitions. [2024-11-20 07:00:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:00:37,251 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-20 07:00:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:00:37,258 INFO L225 Difference]: With dead ends: 198 [2024-11-20 07:00:37,258 INFO L226 Difference]: Without dead ends: 133 [2024-11-20 07:00:37,259 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-20 07:00:37,260 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-20 07:00:37,261 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-20 07:00:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-20 07:00:37,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-20 07:00:37,298 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-20 07:00:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-11-20 07:00:37,301 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 157 [2024-11-20 07:00:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:00:37,305 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-11-20 07:00:37,306 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-20 07:00:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-11-20 07:00:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 07:00:37,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:00:37,310 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-20 07:00:37,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:00:37,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:00:37,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:00:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash 641584241, now seen corresponding path program 1 times [2024-11-20 07:00:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:00:37,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296714492] [2024-11-20 07:00:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:00:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:00:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:00:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:00:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:00:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:00:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:00:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:00:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:00:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 07:00:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 07:00:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:00:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:00:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 07:00:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 07:00:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 07:00:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 07:00:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 07:00:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 07:00:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 07:00:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 07:00:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 07:00:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 07:00:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 07:00:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 07:00:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 07:00:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:37,840 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-20 07:00:37,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:00:37,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296714492] [2024-11-20 07:00:37,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296714492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:00:37,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:00:37,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 07:00:37,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469047420] [2024-11-20 07:00:37,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:00:37,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 07:00:37,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:00:37,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 07:00:37,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:00:37,844 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-20 07:00:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:00:38,087 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2024-11-20 07:00:38,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 07:00:38,088 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-20 07:00:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:00:38,091 INFO L225 Difference]: With dead ends: 276 [2024-11-20 07:00:38,091 INFO L226 Difference]: Without dead ends: 148 [2024-11-20 07:00:38,092 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-20 07:00:38,098 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:00:38,098 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.2s Time] [2024-11-20 07:00:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-20 07:00:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2024-11-20 07:00:38,127 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-20 07:00:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-11-20 07:00:38,132 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 158 [2024-11-20 07:00:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:00:38,134 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-11-20 07:00:38,134 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-20 07:00:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-11-20 07:00:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 07:00:38,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:00:38,141 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-20 07:00:38,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:00:38,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:00:38,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:00:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1646093457, now seen corresponding path program 1 times [2024-11-20 07:00:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:00:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247414589] [2024-11-20 07:00:38,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:00:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:00:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:00:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:00:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:00:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:00:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:00:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:00:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:00:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 07:00:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 07:00:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:00:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:00:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 07:00:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 07:00:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 07:00:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 07:00:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 07:00:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 07:00:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 07:00:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 07:00:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 07:00:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 07:00:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 07:00:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 07:00:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 07:00:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,430 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-20 07:00:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:00:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247414589] [2024-11-20 07:00:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247414589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:00:38,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:00:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:00:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24582381] [2024-11-20 07:00:38,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:00:38,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:00:38,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:00:38,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:00:38,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:00:38,434 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-20 07:00:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:00:38,498 INFO L93 Difference]: Finished difference Result 275 states and 409 transitions. [2024-11-20 07:00:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:00:38,499 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-20 07:00:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:00:38,501 INFO L225 Difference]: With dead ends: 275 [2024-11-20 07:00:38,501 INFO L226 Difference]: Without dead ends: 147 [2024-11-20 07:00:38,502 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-20 07:00:38,507 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-20 07:00:38,508 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-20 07:00:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-20 07:00:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-20 07:00:38,538 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-20 07:00:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-20 07:00:38,540 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 159 [2024-11-20 07:00:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:00:38,541 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-20 07:00:38,542 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-20 07:00:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-20 07:00:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 07:00:38,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:00:38,545 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-20 07:00:38,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 07:00:38,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:00:38,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:00:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1427163110, now seen corresponding path program 1 times [2024-11-20 07:00:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:00:38,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882470634] [2024-11-20 07:00:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:00:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:00:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:00:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:00:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:00:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:00:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:00:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:00:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 07:00:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 07:00:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 07:00:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 07:00:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 07:00:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 07:00:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 07:00:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 07:00:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 07:00:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 07:00:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 07:00:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 07:00:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:38,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 07:00:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:39,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 07:00:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:39,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 07:00:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:39,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-20 07:00:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-20 07:00:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:39,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-20 07:00:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:39,028 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-20 07:00:39,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:00:39,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882470634] [2024-11-20 07:00:39,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882470634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 07:00:39,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480131575] [2024-11-20 07:00:39,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:39,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:00:39,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:00:39,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:00:39,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 07:00:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:39,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 07:00:39,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:00:39,726 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-20 07:00:39,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:00:40,107 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-20 07:00:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480131575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:00:40,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 07:00:40,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2024-11-20 07:00:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454963274] [2024-11-20 07:00:40,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 07:00:40,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 07:00:40,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:00:40,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 07:00:40,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-20 07:00:40,111 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-20 07:00:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:00:40,502 INFO L93 Difference]: Finished difference Result 235 states and 331 transitions. [2024-11-20 07:00:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 07:00:40,502 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-20 07:00:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:00:40,506 INFO L225 Difference]: With dead ends: 235 [2024-11-20 07:00:40,506 INFO L226 Difference]: Without dead ends: 166 [2024-11-20 07:00:40,507 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-20 07:00:40,508 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-20 07:00:40,509 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-20 07:00:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-20 07:00:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2024-11-20 07:00:40,541 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-20 07:00:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 215 transitions. [2024-11-20 07:00:40,543 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 215 transitions. Word has length 160 [2024-11-20 07:00:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:00:40,544 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 215 transitions. [2024-11-20 07:00:40,544 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-20 07:00:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 215 transitions. [2024-11-20 07:00:40,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 07:00:40,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:00:40,547 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-20 07:00:40,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 07:00:40,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:00:40,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:00:40,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:00:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash 166909329, now seen corresponding path program 1 times [2024-11-20 07:00:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:00:40,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504916963] [2024-11-20 07:00:40,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:00:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 07:00:40,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842080199] [2024-11-20 07:00:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:40,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 07:00:40,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:00:40,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 07:00:40,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 07:00:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:00:40,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:00:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:00:41,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:00:41,139 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:00:41,141 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:00:41,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 07:00:41,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 07:00:41,350 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 07:00:41,474 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:00:41,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:00:41 BoogieIcfgContainer [2024-11-20 07:00:41,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:00:41,479 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:00:41,479 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:00:41,479 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:00:41,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:35" (3/4) ... [2024-11-20 07:00:41,482 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:00:41,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:00:41,484 INFO L158 Benchmark]: Toolchain (without parser) took 6804.79ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 93.6MB in the beginning and 195.6MB in the end (delta: -102.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:00:41,484 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:00:41,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.68ms. Allocated memory is still 163.6MB. Free memory was 93.6MB in the beginning and 131.5MB in the end (delta: -37.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-20 07:00:41,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.70ms. Allocated memory is still 163.6MB. Free memory was 131.5MB in the beginning and 127.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:00:41,485 INFO L158 Benchmark]: Boogie Preprocessor took 87.47ms. Allocated memory is still 163.6MB. Free memory was 127.3MB in the beginning and 119.8MB in the end (delta: 7.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:00:41,485 INFO L158 Benchmark]: RCFGBuilder took 523.54ms. Allocated memory is still 163.6MB. Free memory was 119.8MB in the beginning and 95.8MB in the end (delta: 23.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 07:00:41,485 INFO L158 Benchmark]: TraceAbstraction took 5691.62ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 95.0MB in the beginning and 195.6MB in the end (delta: -100.6MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. [2024-11-20 07:00:41,486 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 237.0MB. Free memory is still 195.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:00:41,487 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.16ms. Allocated memory is still 109.1MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.68ms. Allocated memory is still 163.6MB. Free memory was 93.6MB in the beginning and 131.5MB in the end (delta: -37.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.70ms. Allocated memory is still 163.6MB. Free memory was 131.5MB in the beginning and 127.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.47ms. Allocated memory is still 163.6MB. Free memory was 127.3MB in the beginning and 119.8MB in the end (delta: 7.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 523.54ms. Allocated memory is still 163.6MB. Free memory was 119.8MB in the beginning and 95.8MB in the end (delta: 23.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5691.62ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 95.0MB in the beginning and 195.6MB in the end (delta: -100.6MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 237.0MB. Free memory is still 195.6MB. 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, 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=129, var_1_22=0, var_1_23=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=129, var_1_22=0, var_1_23=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] 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=129, var_1_22=0, var_1_23=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] [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=129, var_1_22=0, var_1_23=0, 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=129, var_1_22=0, var_1_23=0, 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=129, var_1_22=0, var_1_23=0, 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=129, var_1_22=0, var_1_23=0, 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=129, var_1_22=0, var_1_23=0, 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=129, var_1_22=0, var_1_23=0, 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=129, var_1_22=0, var_1_23=0, 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=129, var_1_22=0, var_1_23=0, 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=129, var_1_22=0, var_1_23=0, 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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=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] 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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=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] [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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=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] [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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=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] [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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=128, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=128, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=128, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=256, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=128, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=256, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=128, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=256, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=128, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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=256, var_1_16=2, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=128, var_1_21=129, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=1, 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.4s SatisfiabilityAnalysisTime, 2.9s 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-20 07:00:41,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_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-wip.dd.update-z3-fca748b-m [2024-11-20 07:00:43,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:00:43,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:00:43,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:00:43,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:00:43,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:00:43,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:00:43,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:00:43,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:00:43,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:00:43,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:00:43,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:00:43,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:00:43,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:00:43,881 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:00:43,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:00:43,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:00:43,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:00:43,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:00:43,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:00:43,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:00:43,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:00:43,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:00:43,883 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:00:43,883 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:00:43,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:00:43,884 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:00:43,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:00:43,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:00:43,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:00:43,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:00:43,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:00:43,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:00:43,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:00:43,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:00:43,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:00:43,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:00:43,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:00:43,897 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:00:43,897 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:00:43,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:00:43,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:00:43,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:00:43,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:00:43,899 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-20 07:00:44,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:00:44,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:00:44,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:00:44,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:00:44,241 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:00:44,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-20 07:00:45,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:00:45,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:00:45,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-20 07:00:45,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65800b8f1/52156f74bc0344e0b3fef7a1954b2cd2/FLAG9bcd79dcf [2024-11-20 07:00:45,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65800b8f1/52156f74bc0344e0b3fef7a1954b2cd2 [2024-11-20 07:00:45,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:00:45,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:00:45,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:00:45,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:00:45,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:00:45,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:00:45" (1/1) ... [2024-11-20 07:00:46,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d24cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46, skipping insertion in model container [2024-11-20 07:00:46,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:00:45" (1/1) ... [2024-11-20 07:00:46,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:00:46,230 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-20 07:00:46,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:00:46,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:00:46,341 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-20 07:00:46,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:00:46,404 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:00:46,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46 WrapperNode [2024-11-20 07:00:46,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:00:46,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:00:46,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:00:46,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:00:46,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,479 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-11-20 07:00:46,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:00:46,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:00:46,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:00:46,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:00:46,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,519 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:00:46,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:00:46,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:00:46,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:00:46,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:00:46,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (1/1) ... [2024-11-20 07:00:46,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:00:46,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:00:46,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:00:46,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:00:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:00:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:00:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:00:46,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:00:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:00:46,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:00:46,753 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:00:46,756 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:00:53,795 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 07:00:53,796 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:00:53,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:00:53,815 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:00:53,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:53 BoogieIcfgContainer [2024-11-20 07:00:53,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:00:53,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:00:53,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:00:53,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:00:53,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:00:45" (1/3) ... [2024-11-20 07:00:53,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ef5592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:00:53, skipping insertion in model container [2024-11-20 07:00:53,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:46" (2/3) ... [2024-11-20 07:00:53,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10ef5592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:00:53, skipping insertion in model container [2024-11-20 07:00:53,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:53" (3/3) ... [2024-11-20 07:00:53,824 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-79.i [2024-11-20 07:00:53,840 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:00:53,840 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:00:53,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:00:53,905 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;@18186498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:00:53,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:00:53,911 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-20 07:00:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 07:00:53,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:00:53,928 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-20 07:00:53,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:00:53,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:00:53,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1641169731, now seen corresponding path program 1 times [2024-11-20 07:00:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:00:53,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525302335] [2024-11-20 07:00:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:00:53,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:00:53,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:00:53,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 07:00:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:54,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:00:54,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:00:54,477 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-20 07:00:54,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:00:54,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:00:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525302335] [2024-11-20 07:00:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525302335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:00:54,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:00:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:00:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067381394] [2024-11-20 07:00:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:00:54,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:00:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:00:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:00:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:00:54,514 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-20 07:00:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:00:54,542 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2024-11-20 07:00:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:00:54,544 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-20 07:00:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:00:54,550 INFO L225 Difference]: With dead ends: 141 [2024-11-20 07:00:54,550 INFO L226 Difference]: Without dead ends: 68 [2024-11-20 07:00:54,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:00:54,556 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-20 07:00:54,557 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-20 07:00:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-20 07:00:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-20 07:00:54,590 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-20 07:00:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-11-20 07:00:54,594 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 157 [2024-11-20 07:00:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:00:54,594 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-11-20 07:00:54,595 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-20 07:00:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-11-20 07:00:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 07:00:54,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:00:54,598 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-20 07:00:54,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 07:00:54,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:00:54,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:00:54,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:00:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1857591947, now seen corresponding path program 1 times [2024-11-20 07:00:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:00:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121790938] [2024-11-20 07:00:54,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:00:54,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:00:54,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:00:54,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:00:54,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 07:00:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:00:55,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 07:00:55,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:00:56,366 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-20 07:00:56,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:00:56,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:00:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121790938] [2024-11-20 07:00:56,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121790938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:00:56,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:00:56,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 07:00:56,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46074130] [2024-11-20 07:00:56,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:00:56,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 07:00:56,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:00:56,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 07:00:56,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:00:56,371 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-20 07:01:00,752 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-20 07:01:00,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:01:00,996 INFO L93 Difference]: Finished difference Result 213 states and 321 transitions. [2024-11-20 07:01:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 07:01:00,997 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-20 07:01:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:01:01,000 INFO L225 Difference]: With dead ends: 213 [2024-11-20 07:01:01,004 INFO L226 Difference]: Without dead ends: 148 [2024-11-20 07:01:01,005 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-20 07:01:01,008 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 83 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-20 07:01:01,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 344 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-20 07:01:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-20 07:01:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2024-11-20 07:01:01,030 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-20 07:01:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2024-11-20 07:01:01,033 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 157 [2024-11-20 07:01:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:01:01,034 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2024-11-20 07:01:01,034 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-20 07:01:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2024-11-20 07:01:01,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 07:01:01,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:01:01,041 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-20 07:01:01,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 07:01:01,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:01:01,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:01:01,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:01:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1646093457, now seen corresponding path program 1 times [2024-11-20 07:01:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:01:01,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286602577] [2024-11-20 07:01:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:01:01,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:01:01,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:01:01,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:01:01,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 07:01:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:01:01,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 07:01:01,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:01:01,666 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-20 07:01:01,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:01:01,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:01:01,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286602577] [2024-11-20 07:01:01,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286602577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:01:01,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:01:01,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 07:01:01,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867533215] [2024-11-20 07:01:01,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:01:01,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 07:01:01,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:01:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 07:01:01,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 07:01:01,670 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-20 07:01:05,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:01:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:01:05,869 INFO L93 Difference]: Finished difference Result 275 states and 409 transitions. [2024-11-20 07:01:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 07:01:05,870 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-20 07:01:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:01:05,873 INFO L225 Difference]: With dead ends: 275 [2024-11-20 07:01:05,873 INFO L226 Difference]: Without dead ends: 147 [2024-11-20 07:01:05,874 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-20 07:01:05,875 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 33 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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-20 07:01:05,876 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-20 07:01:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-20 07:01:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-20 07:01:05,907 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-20 07:01:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions. [2024-11-20 07:01:05,913 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 159 [2024-11-20 07:01:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:01:05,914 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions. [2024-11-20 07:01:05,914 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-20 07:01:05,914 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions. [2024-11-20 07:01:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 07:01:05,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:01:05,919 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-20 07:01:05,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 07:01:06,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:01:06,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:01:06,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:01:06,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1427163110, now seen corresponding path program 1 times [2024-11-20 07:01:06,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:01:06,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491708901] [2024-11-20 07:01:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:01:06,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:01:06,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:01:06,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:01:06,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 07:01:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:01:06,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 07:01:06,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:01:07,289 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-20 07:01:07,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:01:08,301 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-20 07:01:08,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:01:08,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491708901] [2024-11-20 07:01:08,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491708901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:01:08,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:01:08,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-20 07:01:08,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750322086] [2024-11-20 07:01:08,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:01:08,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 07:01:08,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:01:08,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 07:01:08,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 07:01:08,306 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-20 07:01:12,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 07:01:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:01:12,868 INFO L93 Difference]: Finished difference Result 235 states and 331 transitions. [2024-11-20 07:01:12,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 07:01:12,901 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-20 07:01:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:01:12,906 INFO L225 Difference]: With dead ends: 235 [2024-11-20 07:01:12,906 INFO L226 Difference]: Without dead ends: 166 [2024-11-20 07:01:12,907 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-20 07:01:12,908 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 175 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-20 07:01:12,908 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.3s Time] [2024-11-20 07:01:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-20 07:01:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2024-11-20 07:01:12,948 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-20 07:01:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 216 transitions. [2024-11-20 07:01:12,952 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 216 transitions. Word has length 160 [2024-11-20 07:01:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:01:12,954 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 216 transitions. [2024-11-20 07:01:12,954 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-20 07:01:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 216 transitions. [2024-11-20 07:01:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 07:01:12,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:01:12,958 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-20 07:01:12,975 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 (5)] Forceful destruction successful, exit code 0 [2024-11-20 07:01:13,162 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-20 07:01:13,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:01:13,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:01:13,164 INFO L85 PathProgramCache]: Analyzing trace with hash 166909329, now seen corresponding path program 1 times [2024-11-20 07:01:13,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:01:13,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746692408] [2024-11-20 07:01:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:01:13,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:01:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:01:13,168 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-20 07:01:13,169 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-20 07:01:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:01:13,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 07:01:13,656 INFO L278 TraceCheckSpWp]: Computing forward predicates...