./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0367532259248ca682cef23c751a4218c077539166eeae78f6da36c114ad9d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:07:41,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:07:41,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:07:41,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:07:41,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:07:41,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:07:41,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:07:41,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:07:41,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:07:41,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:07:41,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:07:41,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:07:41,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:07:41,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:07:41,732 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:07:41,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:07:41,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:07:41,733 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:07:41,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:07:41,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:07:41,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:07:41,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:07:41,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:07:41,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:07:41,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:07:41,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:07:41,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:07:41,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:07:41,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:07:41,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:07:41,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:07:41,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:07:41,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:07:41,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:07:41,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:07:41,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:07:41,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:07:41,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:07:41,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:07:41,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:07:41,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:07:41,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:07:41,746 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 -> e0367532259248ca682cef23c751a4218c077539166eeae78f6da36c114ad9d6 [2024-11-16 16:07:42,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:07:42,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:07:42,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:07:42,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:07:42,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:07:42,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i [2024-11-16 16:07:43,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:07:43,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:07:43,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i [2024-11-16 16:07:43,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb8fa1ef5/e28d920906084e0e8ce242b5458bb5fa/FLAG55e63fc6f [2024-11-16 16:07:43,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb8fa1ef5/e28d920906084e0e8ce242b5458bb5fa [2024-11-16 16:07:43,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:07:43,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:07:43,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:07:43,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:07:43,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:07:43,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:07:43" (1/1) ... [2024-11-16 16:07:43,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67955503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:43, skipping insertion in model container [2024-11-16 16:07:43,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:07:43" (1/1) ... [2024-11-16 16:07:43,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:07:43,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i[916,929] [2024-11-16 16:07:44,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:07:44,040 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:07:44,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i[916,929] [2024-11-16 16:07:44,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:07:44,108 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:07:44,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44 WrapperNode [2024-11-16 16:07:44,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:07:44,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:07:44,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:07:44,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:07:44,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,207 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-11-16 16:07:44,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:07:44,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:07:44,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:07:44,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:07:44,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,258 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-16 16:07:44,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,271 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:07:44,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:07:44,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:07:44,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:07:44,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (1/1) ... [2024-11-16 16:07:44,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:07:44,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:07:44,342 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-16 16:07:44,345 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-16 16:07:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:07:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:07:44,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:07:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:07:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:07:44,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:07:44,506 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:07:44,508 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:07:45,006 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: havoc property_#t~bitwise20#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2024-11-16 16:07:45,062 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-16 16:07:45,062 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:07:45,087 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:07:45,088 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:07:45,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:07:45 BoogieIcfgContainer [2024-11-16 16:07:45,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:07:45,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:07:45,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:07:45,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:07:45,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:07:43" (1/3) ... [2024-11-16 16:07:45,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f00f174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:07:45, skipping insertion in model container [2024-11-16 16:07:45,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:44" (2/3) ... [2024-11-16 16:07:45,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f00f174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:07:45, skipping insertion in model container [2024-11-16 16:07:45,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:07:45" (3/3) ... [2024-11-16 16:07:45,099 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-17.i [2024-11-16 16:07:45,115 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:07:45,116 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:07:45,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:07:45,181 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;@392e227c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:07:45,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:07:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 16:07:45,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 16:07:45,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:45,198 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:07:45,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:45,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash -894752941, now seen corresponding path program 1 times [2024-11-16 16:07:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:07:45,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361894263] [2024-11-16 16:07:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:07:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:07:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:07:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:07:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:07:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:07:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:07:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:07:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:07:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:07:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:07:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:07:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:07:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:07:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:07:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:07:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 16:07:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:07:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:07:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:07:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:07:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:07:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:07:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:07:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 16:07:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 16:07:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:07:45,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361894263] [2024-11-16 16:07:45,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361894263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:45,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:45,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:07:45,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603432672] [2024-11-16 16:07:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:45,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:07:45,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:07:45,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:07:45,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:07:45,779 INFO L87 Difference]: Start difference. First operand has 99 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 16:07:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:45,827 INFO L93 Difference]: Finished difference Result 190 states and 315 transitions. [2024-11-16 16:07:45,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:07:45,832 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 169 [2024-11-16 16:07:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:45,844 INFO L225 Difference]: With dead ends: 190 [2024-11-16 16:07:45,844 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 16:07:45,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:07:45,854 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:45,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:07:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 16:07:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 16:07:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 16:07:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2024-11-16 16:07:45,900 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 169 [2024-11-16 16:07:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:45,901 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2024-11-16 16:07:45,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 16:07:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2024-11-16 16:07:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 16:07:45,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:45,906 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:07:45,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:07:45,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:45,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1115453037, now seen corresponding path program 1 times [2024-11-16 16:07:45,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:07:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391917379] [2024-11-16 16:07:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:07:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:07:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:07:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:07:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:07:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:07:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:07:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:07:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:07:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:07:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:07:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:07:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:07:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:07:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:07:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:07:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 16:07:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:07:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:07:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:07:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:07:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:07:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:07:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:07:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 16:07:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 16:07:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:07:46,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391917379] [2024-11-16 16:07:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391917379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:46,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:46,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:07:46,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325270858] [2024-11-16 16:07:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:46,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:07:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:07:46,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:07:46,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:07:46,558 INFO L87 Difference]: Start difference. First operand 94 states and 141 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 16:07:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:46,937 INFO L93 Difference]: Finished difference Result 288 states and 437 transitions. [2024-11-16 16:07:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:07:46,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 169 [2024-11-16 16:07:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:46,944 INFO L225 Difference]: With dead ends: 288 [2024-11-16 16:07:46,944 INFO L226 Difference]: Without dead ends: 197 [2024-11-16 16:07:46,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:07:46,946 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 204 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:46,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 375 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:07:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-16 16:07:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 181. [2024-11-16 16:07:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 130 states have internal predecessors, (178), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 16:07:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 274 transitions. [2024-11-16 16:07:46,999 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 274 transitions. Word has length 169 [2024-11-16 16:07:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:47,000 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 274 transitions. [2024-11-16 16:07:47,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 16:07:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 274 transitions. [2024-11-16 16:07:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 16:07:47,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:47,004 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:07:47,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:07:47,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:47,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash -168680206, now seen corresponding path program 1 times [2024-11-16 16:07:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:07:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853478904] [2024-11-16 16:07:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:07:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:07:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:07:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:07:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:07:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:07:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:07:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:07:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:07:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:07:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:07:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:07:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:07:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:07:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:07:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:07:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 16:07:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:07:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:07:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:07:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:07:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:07:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:07:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:07:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 16:07:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 16:07:48,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:07:48,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853478904] [2024-11-16 16:07:48,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853478904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:48,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:48,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 16:07:48,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080761602] [2024-11-16 16:07:48,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:48,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:07:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:07:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:07:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:07:48,562 INFO L87 Difference]: Start difference. First operand 181 states and 274 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 16:07:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:49,412 INFO L93 Difference]: Finished difference Result 470 states and 706 transitions. [2024-11-16 16:07:49,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 16:07:49,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 170 [2024-11-16 16:07:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:49,417 INFO L225 Difference]: With dead ends: 470 [2024-11-16 16:07:49,417 INFO L226 Difference]: Without dead ends: 379 [2024-11-16 16:07:49,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:07:49,420 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 378 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:49,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 530 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 16:07:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-16 16:07:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 239. [2024-11-16 16:07:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 163 states have (on average 1.343558282208589) internal successors, (219), 163 states have internal predecessors, (219), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 16:07:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 363 transitions. [2024-11-16 16:07:49,489 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 363 transitions. Word has length 170 [2024-11-16 16:07:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:49,490 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 363 transitions. [2024-11-16 16:07:49,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 16:07:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 363 transitions. [2024-11-16 16:07:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 16:07:49,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:49,497 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:07:49,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:07:49,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:49,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash -577504431, now seen corresponding path program 1 times [2024-11-16 16:07:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:07:49,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559147038] [2024-11-16 16:07:49,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:49,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:07:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:07:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:07:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:07:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:07:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:07:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:07:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:07:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:07:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:07:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:07:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 16:07:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 16:07:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 16:07:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 16:07:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 16:07:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 16:07:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 16:07:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:07:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 16:07:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 16:07:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 16:07:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 16:07:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 16:07:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 16:07:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 16:07:49,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:07:49,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559147038] [2024-11-16 16:07:49,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559147038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:07:49,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014891885] [2024-11-16 16:07:49,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:49,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:07:49,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:07:49,968 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-16 16:07:49,970 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-16 16:07:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:50,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:07:50,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:07:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 113 proven. 66 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2024-11-16 16:07:50,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:07:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 16:07:50,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014891885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 16:07:50,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 16:07:50,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 16:07:50,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138482274] [2024-11-16 16:07:50,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 16:07:50,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:07:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:07:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:07:50,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:07:50,702 INFO L87 Difference]: Start difference. First operand 239 states and 363 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-16 16:07:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:50,943 INFO L93 Difference]: Finished difference Result 446 states and 662 transitions. [2024-11-16 16:07:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:07:50,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 170 [2024-11-16 16:07:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:50,950 INFO L225 Difference]: With dead ends: 446 [2024-11-16 16:07:50,952 INFO L226 Difference]: Without dead ends: 263 [2024-11-16 16:07:50,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:07:50,953 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 69 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:50,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 280 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:07:50,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-16 16:07:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 251. [2024-11-16 16:07:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 172 states have (on average 1.308139534883721) internal successors, (225), 172 states have internal predecessors, (225), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 16:07:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 369 transitions. [2024-11-16 16:07:50,999 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 369 transitions. Word has length 170 [2024-11-16 16:07:50,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:50,999 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 369 transitions. [2024-11-16 16:07:51,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-16 16:07:51,000 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 369 transitions. [2024-11-16 16:07:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 16:07:51,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:51,002 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:07:51,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 16:07:51,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:07:51,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:51,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1640253522, now seen corresponding path program 1 times [2024-11-16 16:07:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:07:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972567710] [2024-11-16 16:07:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:07:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:07:51,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2051461703] [2024-11-16 16:07:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:07:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:07:51,346 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-16 16:07:51,348 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-16 16:07:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:07:51,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 16:07:51,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:07:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 16:07:52,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:07:52,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:07:52,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972567710] [2024-11-16 16:07:52,042 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 16:07:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051461703] [2024-11-16 16:07:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051461703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:07:52,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:07:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:07:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782085670] [2024-11-16 16:07:52,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:07:52,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:07:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:07:52,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:07:52,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:07:52,045 INFO L87 Difference]: Start difference. First operand 251 states and 369 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 16:07:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:07:52,264 INFO L93 Difference]: Finished difference Result 518 states and 761 transitions. [2024-11-16 16:07:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:07:52,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 170 [2024-11-16 16:07:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:07:52,267 INFO L225 Difference]: With dead ends: 518 [2024-11-16 16:07:52,268 INFO L226 Difference]: Without dead ends: 324 [2024-11-16 16:07:52,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:07:52,269 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 98 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:07:52,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 452 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:07:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-16 16:07:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 251. [2024-11-16 16:07:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 172 states have (on average 1.302325581395349) internal successors, (224), 172 states have internal predecessors, (224), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 16:07:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 368 transitions. [2024-11-16 16:07:52,306 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 368 transitions. Word has length 170 [2024-11-16 16:07:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:07:52,308 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 368 transitions. [2024-11-16 16:07:52,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 16:07:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 368 transitions. [2024-11-16 16:07:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 16:07:52,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:07:52,310 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:07:52,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 16:07:52,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:07:52,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:07:52,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:07:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2007529844, now seen corresponding path program 1 times [2024-11-16 16:07:52,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:07:52,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334415129] [2024-11-16 16:07:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:07:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:07:52,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768564850] [2024-11-16 16:07:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:07:52,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:07:52,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:07:52,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 16:07:52,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 16:07:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:07:52,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:07:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:07:53,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:07:53,030 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:07:53,031 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:07:53,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 16:07:53,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:07:53,238 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 16:07:53,377 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:07:53,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:07:53 BoogieIcfgContainer [2024-11-16 16:07:53,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:07:53,382 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:07:53,382 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:07:53,382 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:07:53,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:07:45" (3/4) ... [2024-11-16 16:07:53,385 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:07:53,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:07:53,387 INFO L158 Benchmark]: Toolchain (without parser) took 9690.99ms. Allocated memory was 180.4MB in the beginning and 270.5MB in the end (delta: 90.2MB). Free memory was 147.9MB in the beginning and 102.6MB in the end (delta: 45.3MB). Peak memory consumption was 135.5MB. Max. memory is 16.1GB. [2024-11-16 16:07:53,387 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:07:53,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.89ms. Allocated memory is still 180.4MB. Free memory was 147.9MB in the beginning and 130.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 16:07:53,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.00ms. Allocated memory is still 180.4MB. Free memory was 130.0MB in the beginning and 123.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 16:07:53,388 INFO L158 Benchmark]: Boogie Preprocessor took 87.45ms. Allocated memory is still 180.4MB. Free memory was 123.7MB in the beginning and 117.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 16:07:53,388 INFO L158 Benchmark]: IcfgBuilder took 789.93ms. Allocated memory is still 180.4MB. Free memory was 117.5MB in the beginning and 120.3MB in the end (delta: -2.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 16:07:53,389 INFO L158 Benchmark]: TraceAbstraction took 8290.23ms. Allocated memory was 180.4MB in the beginning and 270.5MB in the end (delta: 90.2MB). Free memory was 120.3MB in the beginning and 103.5MB in the end (delta: 16.8MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. [2024-11-16 16:07:53,389 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 270.5MB. Free memory was 103.5MB in the beginning and 102.6MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:07:53,390 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.18ms. Allocated memory is still 104.9MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.89ms. Allocated memory is still 180.4MB. Free memory was 147.9MB in the beginning and 130.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.00ms. Allocated memory is still 180.4MB. Free memory was 130.0MB in the beginning and 123.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.45ms. Allocated memory is still 180.4MB. Free memory was 123.7MB in the beginning and 117.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 789.93ms. Allocated memory is still 180.4MB. Free memory was 117.5MB in the beginning and 120.3MB in the end (delta: -2.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8290.23ms. Allocated memory was 180.4MB in the beginning and 270.5MB in the end (delta: 90.2MB). Free memory was 120.3MB in the beginning and 103.5MB in the end (delta: 16.8MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 270.5MB. Free memory was 103.5MB in the beginning and 102.6MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryArithmeticDOUBLEoperation at line 114, overapproximation of someUnaryDOUBLEoperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_8 = 0; [L24] unsigned char var_1_9 = 1; [L25] signed short int var_1_10 = 1000; [L26] signed long int var_1_11 = -10; [L27] signed short int var_1_12 = 16; [L28] signed short int var_1_14 = 0; [L29] double var_1_16 = 7.3; [L30] double var_1_17 = 0.2; [L31] float var_1_18 = 3.5; [L32] float var_1_19 = 128.2; [L33] float var_1_20 = 5.8; [L34] signed char var_1_21 = 16; [L35] unsigned char var_1_22 = 1; [L36] signed long int var_1_23 = -128; [L37] unsigned short int var_1_24 = 128; [L38] float var_1_26 = 31.25; [L39] float var_1_27 = 0.6; [L40] float var_1_28 = 127.2; [L41] float var_1_29 = 128.18; [L42] float var_1_30 = 31.8; [L43] unsigned char var_1_31 = 25; [L44] unsigned char var_1_33 = 5; [L45] unsigned char var_1_34 = 2; [L46] unsigned char var_1_35 = 128; [L47] unsigned char last_1_var_1_1 = 1; [L48] signed short int last_1_var_1_14 = 0; [L49] signed long int last_1_var_1_23 = -128; [L50] unsigned char last_1_var_1_31 = 25; VAL [isInitial=0, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_14 = var_1_14 [L174] last_1_var_1_23 = var_1_23 [L175] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L132] var_1_8 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L135] var_1_9 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L138] var_1_11 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L142] var_1_12 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L147] var_1_19 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L148] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L149] var_1_21 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_21 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_21 >= -128) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L153] var_1_27 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L155] var_1_28 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L157] var_1_29 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L159] var_1_30 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L161] var_1_33 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L162] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_33 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 <= 64) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L164] var_1_34 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L165] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L167] var_1_35 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_35 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not(var_1_35 >= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L54] COND TRUE (-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11) [L55] var_1_10 = ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L59] signed long int stepLocal_8 = last_1_var_1_14; [L60] unsigned char stepLocal_7 = last_1_var_1_14 <= (last_1_var_1_14 * var_1_12); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_7=1, stepLocal_8=0, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L61] COND TRUE stepLocal_7 && last_1_var_1_1 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_8=0, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L62] COND FALSE !(last_1_var_1_31 <= stepLocal_8) [L69] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L74] var_1_14 = (-2 + (last_1_var_1_31 + last_1_var_1_31)) [L75] unsigned char stepLocal_1 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_1=0, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L76] COND TRUE stepLocal_1 == (-128 * var_1_31) [L77] var_1_16 = (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L81] COND FALSE !(\read(var_1_8)) [L84] var_1_26 = ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L86] signed short int stepLocal_6 = var_1_10; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_6=-128, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L87] COND TRUE stepLocal_6 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14)))) [L88] var_1_24 = ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L92] signed long int stepLocal_5 = 25 * var_1_14; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L93] COND TRUE ! (var_1_31 <= var_1_10) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L94] COND FALSE !(var_1_10 >= stepLocal_5) [L97] var_1_23 = ((var_1_10 + var_1_14) + var_1_24) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L100] unsigned char stepLocal_0 = ((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L101] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L101] COND TRUE ((var_1_31 | var_1_24) <= var_1_31) || stepLocal_0 [L102] var_1_1 = ((! 1) && var_1_8) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L106] unsigned char stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_2=0, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L107] COND TRUE ((var_1_24 + -16) * var_1_23) >= stepLocal_2 [L108] var_1_18 = (64.9f + var_1_19) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L112] signed long int stepLocal_3 = var_1_14 % var_1_21; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=1, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L113] EXPR var_1_31 & var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=1, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L113] COND TRUE stepLocal_3 >= (var_1_31 & var_1_24) [L114] var_1_20 = ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L118] unsigned long int stepLocal_4 = ~ (var_1_31 * 128u); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L119] COND FALSE !(! (var_1_10 <= var_1_23)) [L128] var_1_22 = var_1_9 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L187] RET step() [L188] CALL, EXPR property() [L178] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L178] EXPR ((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L178-L179] return (((((((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19)))) && ((! (var_1_10 <= var_1_23)) ? (var_1_1 ? (((~ (var_1_31 * 128u)) == var_1_23) ? (var_1_22 == ((unsigned char) (! var_1_9))) : 1) : (var_1_22 == ((unsigned char) var_1_9))) : (var_1_22 == ((unsigned char) var_1_9)))) && ((! (var_1_31 <= var_1_10)) ? ((var_1_10 >= (25 * var_1_14)) ? (var_1_23 == ((signed long int) ((((var_1_24) < (var_1_10)) ? (var_1_24) : (var_1_10))))) : (var_1_23 == ((signed long int) ((var_1_10 + var_1_14) + var_1_24)))) : 1)) && ((var_1_10 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14))))) ? (var_1_24 == ((unsigned short int) ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))))) : (var_1_24 == ((unsigned short int) var_1_31)))) && (var_1_8 ? (var_1_26 == ((float) (var_1_19 + ((var_1_27 + var_1_28) + var_1_17)))) : (var_1_26 == ((float) ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))))))) && (((last_1_var_1_14 <= (last_1_var_1_14 * var_1_12)) && last_1_var_1_1) ? ((last_1_var_1_31 <= last_1_var_1_14) ? (((- var_1_19) >= var_1_17) ? (var_1_31 == ((unsigned char) (128 - ((((100) < ((var_1_33 + var_1_34))) ? (100) : ((var_1_33 + var_1_34))))))) : (var_1_31 == ((unsigned char) (var_1_35 - 5)))) : (var_1_31 == ((unsigned char) var_1_33))) : (var_1_31 == ((unsigned char) var_1_33))) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-2147483648, var_1_12=-1, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=47, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=-129, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 749 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 749 mSDsluCounter, 1774 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1129 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 758 IncrementalHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 645 mSDtfsCounter, 758 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 725 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=4, InterpolantAutomatonStates: 28, 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, 241 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1530 NumberOfCodeBlocks, 1530 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1181 ConstructedInterpolants, 0 QuantifiedInterpolants, 5405 SizeOfPredicates, 4 NumberOfNonLiveVariables, 805 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 7530/7728 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-16 16:07:53,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0367532259248ca682cef23c751a4218c077539166eeae78f6da36c114ad9d6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:07:55,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:07:55,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:07:55,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:07:55,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:07:55,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:07:55,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:07:55,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:07:55,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:07:55,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:07:55,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:07:55,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:07:55,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:07:55,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:07:55,914 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:07:55,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:07:55,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:07:55,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:07:55,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:07:55,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:07:55,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:07:55,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:07:55,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:07:55,918 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:07:55,918 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:07:55,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:07:55,918 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:07:55,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:07:55,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:07:55,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:07:55,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:07:55,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:07:55,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:07:55,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:07:55,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:07:55,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:07:55,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:07:55,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:07:55,921 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:07:55,921 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:07:55,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:07:55,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:07:55,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:07:55,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:07:55,924 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 -> e0367532259248ca682cef23c751a4218c077539166eeae78f6da36c114ad9d6 [2024-11-16 16:07:56,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:07:56,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:07:56,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:07:56,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:07:56,306 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:07:56,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i [2024-11-16 16:07:57,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:07:58,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:07:58,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i [2024-11-16 16:07:58,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a818af194/de6f2b761e6a417a92188347c69f6e6d/FLAGc3777ea39 [2024-11-16 16:07:58,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a818af194/de6f2b761e6a417a92188347c69f6e6d [2024-11-16 16:07:58,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:07:58,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:07:58,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:07:58,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:07:58,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:07:58,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1b726b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58, skipping insertion in model container [2024-11-16 16:07:58,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:07:58,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i[916,929] [2024-11-16 16:07:58,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:07:58,582 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:07:58,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i[916,929] [2024-11-16 16:07:58,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:07:58,686 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:07:58,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58 WrapperNode [2024-11-16 16:07:58,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:07:58,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:07:58,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:07:58,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:07:58,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,746 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-16 16:07:58,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:07:58,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:07:58,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:07:58,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:07:58,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,805 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-16 16:07:58,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:07:58,828 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:07:58,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:07:58,829 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:07:58,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (1/1) ... [2024-11-16 16:07:58,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:07:58,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:07:58,870 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-16 16:07:58,877 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-16 16:07:58,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:07:58,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:07:58,926 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:07:58,927 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:07:58,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:07:58,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:07:59,041 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:07:59,044 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:08:11,019 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-16 16:08:11,020 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:08:11,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:08:11,034 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:08:11,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:08:11 BoogieIcfgContainer [2024-11-16 16:08:11,035 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:08:11,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:08:11,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:08:11,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:08:11,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:07:58" (1/3) ... [2024-11-16 16:08:11,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d7dce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:08:11, skipping insertion in model container [2024-11-16 16:08:11,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:07:58" (2/3) ... [2024-11-16 16:08:11,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d7dce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:08:11, skipping insertion in model container [2024-11-16 16:08:11,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:08:11" (3/3) ... [2024-11-16 16:08:11,044 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-17.i [2024-11-16 16:08:11,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:08:11,063 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:08:11,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:08:11,132 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;@5e665d07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:08:11,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:08:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 16:08:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 16:08:11,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:08:11,154 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:08:11,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:08:11,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:08:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1848132647, now seen corresponding path program 1 times [2024-11-16 16:08:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:08:11,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192340270] [2024-11-16 16:08:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:08:11,177 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-16 16:08:11,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:08:11,181 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-16 16:08:11,226 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-16 16:08:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:08:12,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:08:12,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:08:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-16 16:08:12,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:08:12,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:08:12,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192340270] [2024-11-16 16:08:12,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192340270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:08:12,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:08:12,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:08:12,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792113056] [2024-11-16 16:08:12,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:08:12,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:08:12,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:08:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:08:12,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:08:12,220 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 16:08:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:08:12,245 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2024-11-16 16:08:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:08:12,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 163 [2024-11-16 16:08:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:08:12,253 INFO L225 Difference]: With dead ends: 158 [2024-11-16 16:08:12,253 INFO L226 Difference]: Without dead ends: 78 [2024-11-16 16:08:12,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-16 16:08:12,258 INFO L432 NwaCegarLoop]: 116 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, 116 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-16 16:08:12,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:08:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-16 16:08:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-16 16:08:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 16:08:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-11-16 16:08:12,303 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 163 [2024-11-16 16:08:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:08:12,304 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-11-16 16:08:12,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 16:08:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-11-16 16:08:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 16:08:12,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:08:12,308 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:08:12,335 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-16 16:08:12,508 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-16 16:08:12,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:08:12,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:08:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash 880897729, now seen corresponding path program 1 times [2024-11-16 16:08:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:08:12,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778221493] [2024-11-16 16:08:12,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:08:12,511 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-16 16:08:12,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:08:12,514 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-16 16:08:12,518 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-16 16:08:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:08:13,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:08:13,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:08:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 16:08:19,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:08:19,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:08:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778221493] [2024-11-16 16:08:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778221493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:08:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:08:19,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:08:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124170217] [2024-11-16 16:08:19,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:08:19,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:08:19,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:08:19,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:08:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:08:19,420 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 16:08:24,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:08:28,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:08:32,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:08:37,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:08:41,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:08:45,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:08:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:08:45,217 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2024-11-16 16:08:45,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:08:45,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-11-16 16:08:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:08:45,302 INFO L225 Difference]: With dead ends: 230 [2024-11-16 16:08:45,302 INFO L226 Difference]: Without dead ends: 155 [2024-11-16 16:08:45,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:08:45,304 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 49 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2024-11-16 16:08:45,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 379 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 25.5s Time] [2024-11-16 16:08:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-16 16:08:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2024-11-16 16:08:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 75 states have internal predecessors, (92), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 16:08:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2024-11-16 16:08:45,348 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 163 [2024-11-16 16:08:45,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:08:45,349 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2024-11-16 16:08:45,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 16:08:45,349 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2024-11-16 16:08:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-16 16:08:45,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:08:45,353 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:08:45,393 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 (3)] Forceful destruction successful, exit code 0 [2024-11-16 16:08:45,554 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-16 16:08:45,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:08:45,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:08:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1593449819, now seen corresponding path program 1 times [2024-11-16 16:08:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:08:45,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432750547] [2024-11-16 16:08:45,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:08:45,556 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-16 16:08:45,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:08:45,559 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-16 16:08:45,561 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-16 16:08:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:08:46,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 16:08:46,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:08:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 113 proven. 66 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2024-11-16 16:08:49,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:08:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 3 proven. 66 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 16:08:51,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:08:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432750547] [2024-11-16 16:08:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432750547] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 16:08:51,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 16:08:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 16:08:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386315683] [2024-11-16 16:08:51,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 16:08:51,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:08:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:08:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:08:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:08:51,986 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-16 16:08:58,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:09:02,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:09:06,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:09:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:09:06,996 INFO L93 Difference]: Finished difference Result 217 states and 315 transitions. [2024-11-16 16:09:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:09:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 164 [2024-11-16 16:09:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:09:07,078 INFO L225 Difference]: With dead ends: 217 [2024-11-16 16:09:07,078 INFO L226 Difference]: Without dead ends: 142 [2024-11-16 16:09:07,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:09:07,080 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 43 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-11-16 16:09:07,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 216 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 14.7s Time] [2024-11-16 16:09:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-16 16:09:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2024-11-16 16:09:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 81 states have internal predecessors, (97), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 16:09:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 193 transitions. [2024-11-16 16:09:07,109 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 193 transitions. Word has length 164 [2024-11-16 16:09:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:09:07,109 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 193 transitions. [2024-11-16 16:09:07,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-16 16:09:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 193 transitions. [2024-11-16 16:09:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-16 16:09:07,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:09:07,112 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:09:07,149 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-16 16:09:07,313 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-16 16:09:07,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:09:07,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:09:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1704445124, now seen corresponding path program 1 times [2024-11-16 16:09:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:09:07,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243154290] [2024-11-16 16:09:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:09:07,315 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-16 16:09:07,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:09:07,317 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-16 16:09:07,318 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-16 16:09:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:09:08,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:09:08,099 INFO L278 TraceCheckSpWp]: Computing forward predicates...