./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.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 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:24:55,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:24:55,457 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:24:55,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:24:55,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:24:55,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:24:55,477 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:24:55,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:24:55,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:24:55,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:24:55,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:24:55,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:24:55,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:24:55,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:24:55,480 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:24:55,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:24:55,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:24:55,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:24:55,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:24:55,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:24:55,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:24:55,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:24:55,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:24:55,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:24:55,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:24:55,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:24:55,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:24:55,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:24:55,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:24:55,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:24:55,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:24:55,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:24:55,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:24:55,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:24:55,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:24:55,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:24:55,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:24:55,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:24:55,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:24:55,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:24:55,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:24:55,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:24:55,487 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 -> 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 [2024-10-24 07:24:55,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:24:55,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:24:55,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:24:55,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:24:55,739 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:24:55,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-24 07:24:57,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:24:57,251 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:24:57,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-24 07:24:57,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1df9edd7/718ae9947e364de3a707c05ac99bf7b3/FLAG7b6ea3497 [2024-10-24 07:24:57,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1df9edd7/718ae9947e364de3a707c05ac99bf7b3 [2024-10-24 07:24:57,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:24:57,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:24:57,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:24:57,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:24:57,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:24:57,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:57" (1/1) ... [2024-10-24 07:24:57,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2f00e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:57, skipping insertion in model container [2024-10-24 07:24:57,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:24:57" (1/1) ... [2024-10-24 07:24:57,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:24:57,802 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2024-10-24 07:24:57,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:24:57,887 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:24:57,897 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2024-10-24 07:24:57,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:24:58,004 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:24:58,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58 WrapperNode [2024-10-24 07:24:58,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:24:58,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:24:58,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:24:58,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:24:58,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,059 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-24 07:24:58,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:24:58,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:24:58,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:24:58,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:24:58,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,099 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-10-24 07:24:58,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:24:58,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:24:58,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:24:58,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:24:58,135 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (1/1) ... [2024-10-24 07:24:58,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:24:58,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:24:58,163 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-10-24 07:24:58,169 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-10-24 07:24:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:24:58,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:24:58,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:24:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:24:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:24:58,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:24:58,276 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:24:58,278 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:24:58,566 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 07:24:58,566 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:24:58,598 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:24:58,598 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:24:58,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:24:58 BoogieIcfgContainer [2024-10-24 07:24:58,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:24:58,600 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:24:58,600 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:24:58,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:24:58,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:24:57" (1/3) ... [2024-10-24 07:24:58,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75aa6740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:24:58, skipping insertion in model container [2024-10-24 07:24:58,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:24:58" (2/3) ... [2024-10-24 07:24:58,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75aa6740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:24:58, skipping insertion in model container [2024-10-24 07:24:58,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:24:58" (3/3) ... [2024-10-24 07:24:58,605 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-24 07:24:58,616 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:24:58,617 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:24:58,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:24:58,666 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;@36e9f289, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:24:58,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:24:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 07:24:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 07:24:58,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:58,680 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:24:58,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:58,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash -325050660, now seen corresponding path program 1 times [2024-10-24 07:24:58,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:24:58,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206854289] [2024-10-24 07:24:58,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:58,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:24:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:24:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:24:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:24:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:24:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:24:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 07:24:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:24:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:24:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:24:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:24:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:24:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:24:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:24:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:24:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:24:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:24:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:24:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:24:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:24:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:24:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:24:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:24:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:24:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:24:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:24:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:24:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:24:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 07:24:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:24:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 07:24:59,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:24:59,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206854289] [2024-10-24 07:24:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206854289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:24:59,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:24:59,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:24:59,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227787602] [2024-10-24 07:24:59,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:59,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:24:59,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:24:59,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:24:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:24:59,214 INFO L87 Difference]: Start difference. First operand has 90 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 07:24:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:59,264 INFO L93 Difference]: Finished difference Result 176 states and 317 transitions. [2024-10-24 07:24:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:24:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 185 [2024-10-24 07:24:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:59,279 INFO L225 Difference]: With dead ends: 176 [2024-10-24 07:24:59,279 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 07:24:59,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-10-24 07:24:59,286 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:59,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:24:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 07:24:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 07:24:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 07:24:59,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2024-10-24 07:24:59,371 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 185 [2024-10-24 07:24:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:59,371 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2024-10-24 07:24:59,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 07:24:59,373 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2024-10-24 07:24:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 07:24:59,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:59,377 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:24:59,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:24:59,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:59,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash 951960082, now seen corresponding path program 1 times [2024-10-24 07:24:59,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:24:59,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525568740] [2024-10-24 07:24:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:59,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:24:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:24:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:24:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:24:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:24:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:24:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 07:24:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:24:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:24:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:24:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:24:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:24:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:24:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:24:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:24:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:24:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:24:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:24:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:24:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:24:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:24:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:24:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:24:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:24:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:24:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:24:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:24:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:24:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 07:24:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:24:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:24:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 07:24:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:24:59,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525568740] [2024-10-24 07:24:59,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525568740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:24:59,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:24:59,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:24:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121842341] [2024-10-24 07:24:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:24:59,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:24:59,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:24:59,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:24:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:59,786 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 07:24:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:24:59,855 INFO L93 Difference]: Finished difference Result 231 states and 367 transitions. [2024-10-24 07:24:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:24:59,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-10-24 07:24:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:24:59,862 INFO L225 Difference]: With dead ends: 231 [2024-10-24 07:24:59,862 INFO L226 Difference]: Without dead ends: 145 [2024-10-24 07:24:59,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:24:59,867 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 41 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:24:59,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 252 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:24:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-24 07:24:59,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2024-10-24 07:24:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-24 07:24:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 222 transitions. [2024-10-24 07:24:59,894 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 222 transitions. Word has length 185 [2024-10-24 07:24:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:24:59,895 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 222 transitions. [2024-10-24 07:24:59,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 07:24:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 222 transitions. [2024-10-24 07:24:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 07:24:59,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:24:59,898 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:24:59,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:24:59,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:24:59,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:24:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1753267750, now seen corresponding path program 1 times [2024-10-24 07:24:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:24:59,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291609957] [2024-10-24 07:24:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:24:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:24:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:25:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:25:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:25:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:25:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:25:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 07:25:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:25:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:25:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:25:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:25:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:25:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:25:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:25:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:25:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:25:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:25:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:25:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:25:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:25:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:25:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:25:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:25:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:25:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:25:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:25:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:25:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:25:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 07:25:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:25:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 07:25:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:25:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291609957] [2024-10-24 07:25:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291609957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:25:00,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:25:00,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 07:25:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208415812] [2024-10-24 07:25:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:25:00,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 07:25:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:25:00,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 07:25:00,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:25:00,600 INFO L87 Difference]: Start difference. First operand 141 states and 222 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 07:25:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:01,533 INFO L93 Difference]: Finished difference Result 426 states and 651 transitions. [2024-10-24 07:25:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 07:25:01,534 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-10-24 07:25:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:01,537 INFO L225 Difference]: With dead ends: 426 [2024-10-24 07:25:01,537 INFO L226 Difference]: Without dead ends: 340 [2024-10-24 07:25:01,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-24 07:25:01,539 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 621 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:01,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 674 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 07:25:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-24 07:25:01,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 300. [2024-10-24 07:25:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 200 states have (on average 1.405) internal successors, (281), 203 states have internal predecessors, (281), 91 states have call successors, (91), 8 states have call predecessors, (91), 8 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-24 07:25:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 463 transitions. [2024-10-24 07:25:01,615 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 463 transitions. Word has length 187 [2024-10-24 07:25:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:01,616 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 463 transitions. [2024-10-24 07:25:01,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 07:25:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 463 transitions. [2024-10-24 07:25:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 07:25:01,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:01,626 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:25:01,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:25:01,626 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:01,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash 852755804, now seen corresponding path program 1 times [2024-10-24 07:25:01,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:01,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681721715] [2024-10-24 07:25:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:01,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:25:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:25:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:25:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:25:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:25:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 07:25:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:25:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:25:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:25:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:25:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:25:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:25:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:25:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:25:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:25:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:25:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:25:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:25:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:25:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:25:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:25:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:25:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:25:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:25:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:25:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:25:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:25:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 07:25:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:25:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 07:25:01,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:25:01,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681721715] [2024-10-24 07:25:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681721715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:25:01,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:25:01,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:25:01,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994813758] [2024-10-24 07:25:01,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:25:01,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:25:01,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:25:01,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:25:01,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:25:01,802 INFO L87 Difference]: Start difference. First operand 300 states and 463 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 07:25:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:01,873 INFO L93 Difference]: Finished difference Result 529 states and 803 transitions. [2024-10-24 07:25:01,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:25:01,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-24 07:25:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:01,877 INFO L225 Difference]: With dead ends: 529 [2024-10-24 07:25:01,877 INFO L226 Difference]: Without dead ends: 404 [2024-10-24 07:25:01,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:25:01,879 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:01,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 262 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:25:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-24 07:25:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 346. [2024-10-24 07:25:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 235 states have (on average 1.4127659574468086) internal successors, (332), 239 states have internal predecessors, (332), 101 states have call successors, (101), 9 states have call predecessors, (101), 9 states have return successors, (101), 97 states have call predecessors, (101), 101 states have call successors, (101) [2024-10-24 07:25:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 534 transitions. [2024-10-24 07:25:01,907 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 534 transitions. Word has length 187 [2024-10-24 07:25:01,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:01,907 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 534 transitions. [2024-10-24 07:25:01,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 07:25:01,908 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 534 transitions. [2024-10-24 07:25:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 07:25:01,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:01,909 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:25:01,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:25:01,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:01,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash 852815386, now seen corresponding path program 1 times [2024-10-24 07:25:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:01,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243952694] [2024-10-24 07:25:01,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:01,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:25:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:25:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:25:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 07:25:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 07:25:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 07:25:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 07:25:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 07:25:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 07:25:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:25:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:25:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:25:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:25:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 07:25:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 07:25:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 07:25:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:25:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 07:25:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:25:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 07:25:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 07:25:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 07:25:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 07:25:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 07:25:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 07:25:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 07:25:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:25:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 07:25:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:25:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 33 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-24 07:25:02,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:25:02,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243952694] [2024-10-24 07:25:02,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243952694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:25:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807831285] [2024-10-24 07:25:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:02,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:25:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:25:02,378 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-10-24 07:25:02,380 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-10-24 07:25:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:02,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 07:25:02,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:25:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 810 proven. 33 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-24 07:25:02,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:25:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 33 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-24 07:25:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807831285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:25:03,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:25:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2024-10-24 07:25:03,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389649027] [2024-10-24 07:25:03,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:25:03,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 07:25:03,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:25:03,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 07:25:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-24 07:25:03,138 INFO L87 Difference]: Start difference. First operand 346 states and 534 transitions. Second operand has 17 states, 16 states have (on average 5.875) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (87), 5 states have call predecessors, (87), 6 states have call successors, (87) [2024-10-24 07:25:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:03,758 INFO L93 Difference]: Finished difference Result 553 states and 854 transitions. [2024-10-24 07:25:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 07:25:03,758 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.875) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (87), 5 states have call predecessors, (87), 6 states have call successors, (87) Word has length 187 [2024-10-24 07:25:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:03,761 INFO L225 Difference]: With dead ends: 553 [2024-10-24 07:25:03,761 INFO L226 Difference]: Without dead ends: 270 [2024-10-24 07:25:03,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2024-10-24 07:25:03,763 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 234 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:03,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 594 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 07:25:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-24 07:25:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 198. [2024-10-24 07:25:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 125 states have internal predecessors, (168), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 07:25:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 304 transitions. [2024-10-24 07:25:03,803 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 304 transitions. Word has length 187 [2024-10-24 07:25:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:03,804 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 304 transitions. [2024-10-24 07:25:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.875) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (87), 5 states have call predecessors, (87), 6 states have call successors, (87) [2024-10-24 07:25:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 304 transitions. [2024-10-24 07:25:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 07:25:03,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:03,806 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:25:03,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 07:25:04,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:25:04,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:04,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1724051096, now seen corresponding path program 1 times [2024-10-24 07:25:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932752776] [2024-10-24 07:25:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:25:04,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925710161] [2024-10-24 07:25:04,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:25:04,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:25:04,065 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-10-24 07:25:04,069 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-10-24 07:25:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:04,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 07:25:04,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:25:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 07:25:04,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:25:04,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:25:04,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932752776] [2024-10-24 07:25:04,386 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 07:25:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925710161] [2024-10-24 07:25:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925710161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:25:04,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:25:04,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:25:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848079578] [2024-10-24 07:25:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:25:04,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:25:04,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:25:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:25:04,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:25:04,388 INFO L87 Difference]: Start difference. First operand 198 states and 304 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 07:25:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:04,616 INFO L93 Difference]: Finished difference Result 405 states and 644 transitions. [2024-10-24 07:25:04,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 07:25:04,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-24 07:25:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:04,619 INFO L225 Difference]: With dead ends: 405 [2024-10-24 07:25:04,619 INFO L226 Difference]: Without dead ends: 273 [2024-10-24 07:25:04,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:25:04,620 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:04,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 364 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:25:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-24 07:25:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 205. [2024-10-24 07:25:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 131 states have (on average 1.3587786259541985) internal successors, (178), 132 states have internal predecessors, (178), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 07:25:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 314 transitions. [2024-10-24 07:25:04,661 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 314 transitions. Word has length 187 [2024-10-24 07:25:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:04,661 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 314 transitions. [2024-10-24 07:25:04,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 07:25:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 314 transitions. [2024-10-24 07:25:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 07:25:04,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:04,663 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:25:04,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:25:04,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 07:25:04,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:04,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash 135703194, now seen corresponding path program 1 times [2024-10-24 07:25:04,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:25:04,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699192354] [2024-10-24 07:25:04,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:04,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:25:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:25:04,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802727189] [2024-10-24 07:25:04,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:04,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:25:04,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:25:04,917 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-10-24 07:25:04,918 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-10-24 07:25:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:25:05,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:25:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:25:05,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:25:05,138 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:25:05,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:25:05,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 07:25:05,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:25:05,346 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:25:05,429 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:25:05,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:25:05 BoogieIcfgContainer [2024-10-24 07:25:05,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:25:05,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:25:05,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:25:05,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:25:05,433 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:24:58" (3/4) ... [2024-10-24 07:25:05,434 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:25:05,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:25:05,435 INFO L158 Benchmark]: Toolchain (without parser) took 7784.32ms. Allocated memory was 163.6MB in the beginning and 306.2MB in the end (delta: 142.6MB). Free memory was 93.4MB in the beginning and 198.8MB in the end (delta: -105.4MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2024-10-24 07:25:05,435 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:25:05,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.08ms. Allocated memory is still 163.6MB. Free memory was 93.3MB in the beginning and 131.1MB in the end (delta: -37.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-10-24 07:25:05,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.18ms. Allocated memory is still 163.6MB. Free memory was 131.1MB in the beginning and 128.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 07:25:05,436 INFO L158 Benchmark]: Boogie Preprocessor took 71.90ms. Allocated memory is still 163.6MB. Free memory was 128.1MB in the beginning and 123.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 07:25:05,436 INFO L158 Benchmark]: RCFGBuilder took 465.78ms. Allocated memory is still 163.6MB. Free memory was 123.9MB in the beginning and 96.1MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 07:25:05,436 INFO L158 Benchmark]: TraceAbstraction took 6831.75ms. Allocated memory was 163.6MB in the beginning and 306.2MB in the end (delta: 142.6MB). Free memory was 95.5MB in the beginning and 198.8MB in the end (delta: -103.4MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-10-24 07:25:05,437 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 306.2MB. Free memory is still 198.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:25:05,437 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.08ms. Allocated memory is still 163.6MB. Free memory was 93.3MB in the beginning and 131.1MB in the end (delta: -37.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.18ms. Allocated memory is still 163.6MB. Free memory was 131.1MB in the beginning and 128.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.90ms. Allocated memory is still 163.6MB. Free memory was 128.1MB in the beginning and 123.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 465.78ms. Allocated memory is still 163.6MB. Free memory was 123.9MB in the beginning and 96.1MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6831.75ms. Allocated memory was 163.6MB in the beginning and 306.2MB in the end (delta: 142.6MB). Free memory was 95.5MB in the beginning and 198.8MB in the end (delta: -103.4MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 306.2MB. Free memory is still 198.8MB. 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 195, overapproximation of someBinaryArithmeticDOUBLEoperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 195, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -1; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 5.5; [L25] float var_1_5 = 255.475; [L26] unsigned char var_1_7 = 0; [L27] signed char var_1_8 = -5; [L28] signed char var_1_9 = 2; [L29] unsigned char var_1_10 = 16; [L30] unsigned char var_1_11 = 16; [L31] float var_1_12 = 10000000.8; [L32] float var_1_13 = 127.7; [L33] float var_1_14 = 199.2; [L34] float var_1_15 = 999999.5; [L35] signed long int var_1_16 = -8; [L36] signed short int var_1_18 = -8; [L37] double var_1_19 = 5.4; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L40] signed char var_1_22 = 1; [L41] signed short int var_1_25 = 32; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned long int var_1_29 = 5; [L45] unsigned long int var_1_30 = 4; [L46] unsigned char var_1_31 = 2; [L47] unsigned char var_1_34 = 5; [L48] unsigned char var_1_35 = 25; [L49] unsigned char var_1_36 = 10; [L50] unsigned short int var_1_37 = 64; [L51] unsigned short int var_1_38 = 16; [L52] signed long int var_1_39 = -50; [L53] signed char last_1_var_1_1 = -1; [L54] unsigned char last_1_var_1_10 = 16; [L55] signed long int last_1_var_1_16 = -8; [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L190] last_1_var_1_1 = var_1_1 [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_16 = var_1_16 [L202] RET updateLastVariables() [L203] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L143] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L145] var_1_4 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L146] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L147] var_1_5 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L148] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L152] var_1_8 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L153] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L154] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L154] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L158] var_1_11 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L161] var_1_13 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L162] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L163] var_1_14 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L164] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L165] var_1_15 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L166] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L167] var_1_21 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L169] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L170] var_1_25 = __VERIFIER_nondet_short() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_25 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_25 <= 32) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L173] var_1_28 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L174] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L175] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L176] var_1_30 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L178] CALL assume_abort_if_not(var_1_30 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L178] RET assume_abort_if_not(var_1_30 <= 8) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L179] var_1_34 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L180] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L181] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L182] var_1_35 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L183] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L184] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L185] var_1_36 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L186] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_36 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L187] RET assume_abort_if_not(var_1_36 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L203] RET updateVariables() [L204] CALL step() [L59] signed long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_0=-8, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L60] COND FALSE !(var_1_9 < stepLocal_0) [L65] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L67] COND TRUE 64 >= (10 * var_1_16) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L68] EXPR var_1_16 >> var_1_30 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L68] COND FALSE !(var_1_25 <= (var_1_16 >> var_1_30)) [L71] var_1_29 = var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L74] COND TRUE \read(var_1_7) [L75] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L79] EXPR var_1_11 >> var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L79] COND FALSE !(var_1_1 > ((var_1_11 >> var_1_25) * var_1_10)) [L82] EXPR var_1_30 & var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L82] COND FALSE !(var_1_16 < (var_1_30 & var_1_11)) [L87] COND TRUE var_1_9 >= var_1_11 [L88] var_1_37 = ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L92] COND TRUE 100.75 >= ((((var_1_4 + var_1_3) < 0 ) ? -(var_1_4 + var_1_3) : (var_1_4 + var_1_3))) [L93] var_1_39 = ((((var_1_11) < (var_1_34)) ? (var_1_11) : (var_1_34))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L95] signed long int stepLocal_2 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L96] COND TRUE ! (last_1_var_1_1 > last_1_var_1_10) [L97] var_1_19 = ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L103] COND TRUE var_1_5 <= (var_1_19 / var_1_3) [L104] var_1_12 = ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L108] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L109] COND FALSE !((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) [L116] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L118] COND FALSE !((-128 >> 10u) >= var_1_10) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L123] signed char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_1=2, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L124] COND FALSE !(stepLocal_1 >= (var_1_16 + var_1_10)) [L135] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L137] COND TRUE var_1_11 < var_1_16 [L138] var_1_38 = (((((((5) < (var_1_25)) ? (5) : (var_1_25))) < 0 ) ? -((((5) < (var_1_25)) ? (5) : (var_1_25))) : ((((5) < (var_1_25)) ? (5) : (var_1_25))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L204] RET step() [L205] CALL, EXPR property() [L195-L196] return (((((((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) ? (var_1_7 ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_9))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_9 < last_1_var_1_16) ? (((var_1_4 - var_1_5) > var_1_3) ? (var_1_10 == ((unsigned char) 8)) : 1) : (var_1_10 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_19 / var_1_3)) ? (var_1_12 == ((float) ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) : (var_1_12 == ((float) var_1_14)))) && (var_1_7 ? (var_1_16 == ((signed long int) var_1_8)) : (var_1_16 == ((signed long int) (var_1_11 - ((((var_1_10 - var_1_10) < 0 ) ? -(var_1_10 - var_1_10) : (var_1_10 - var_1_10)))))))) && ((var_1_1 >= (var_1_16 + var_1_10)) ? ((var_1_5 < 999.5f) ? (var_1_7 ? (var_1_18 == ((signed short int) (var_1_16 + var_1_16))) : (var_1_18 == ((signed short int) var_1_8))) : (var_1_18 == ((signed short int) var_1_9))) : (var_1_18 == ((signed short int) var_1_8)))) && ((! (last_1_var_1_1 > last_1_var_1_10)) ? (var_1_19 == ((double) ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))))) : ((last_1_var_1_10 > var_1_9) ? (var_1_19 == ((double) var_1_15)) : 1)) ; [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1154 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1109 mSDsluCounter, 2281 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1500 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1954 IncrementalHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 781 mSDtfsCounter, 1954 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=4, InterpolantAutomatonStates: 42, 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, 6 MinimizatonAttempts, 242 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1866 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1484 ConstructedInterpolants, 0 QuantifiedInterpolants, 4415 SizeOfPredicates, 4 NumberOfNonLiveVariables, 873 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12893/12992 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-10-24 07:25:05,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.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 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:25:07,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:25:07,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:25:07,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:25:07,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:25:07,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:25:07,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:25:07,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:25:07,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:25:07,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:25:07,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:25:07,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:25:07,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:25:07,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:25:07,743 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:25:07,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:25:07,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:25:07,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:25:07,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:25:07,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:25:07,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:25:07,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:25:07,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:25:07,748 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:25:07,748 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:25:07,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:25:07,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:25:07,749 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:25:07,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:25:07,749 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:25:07,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:25:07,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:25:07,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:25:07,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:25:07,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:25:07,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:25:07,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:25:07,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:25:07,751 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:25:07,751 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:25:07,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:25:07,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:25:07,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:25:07,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:25:07,753 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:25:07,754 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 -> 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 [2024-10-24 07:25:08,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:25:08,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:25:08,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:25:08,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:25:08,055 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:25:08,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-24 07:25:09,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:25:09,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:25:09,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-24 07:25:09,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fad5efc6/fafc1d2ef872436ebbd211a19fce5fc3/FLAG6d931e9ec [2024-10-24 07:25:09,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fad5efc6/fafc1d2ef872436ebbd211a19fce5fc3 [2024-10-24 07:25:09,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:25:09,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:25:09,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:25:09,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:25:09,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:25:09,742 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:25:09" (1/1) ... [2024-10-24 07:25:09,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664000f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:09, skipping insertion in model container [2024-10-24 07:25:09,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:25:09" (1/1) ... [2024-10-24 07:25:09,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:25:09,917 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2024-10-24 07:25:09,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:25:10,008 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:25:10,019 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2024-10-24 07:25:10,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:25:10,062 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:25:10,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10 WrapperNode [2024-10-24 07:25:10,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:25:10,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:25:10,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:25:10,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:25:10,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,110 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-10-24 07:25:10,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:25:10,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:25:10,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:25:10,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:25:10,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,141 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-10-24 07:25:10,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:25:10,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:25:10,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:25:10,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:25:10,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (1/1) ... [2024-10-24 07:25:10,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:25:10,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:25:10,197 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-10-24 07:25:10,203 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-10-24 07:25:10,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:25:10,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:25:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:25:10,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:25:10,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:25:10,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:25:10,306 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:25:10,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:25:33,234 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 07:25:33,234 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:25:33,291 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:25:33,292 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:25:33,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:25:33 BoogieIcfgContainer [2024-10-24 07:25:33,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:25:33,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:25:33,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:25:33,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:25:33,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:25:09" (1/3) ... [2024-10-24 07:25:33,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf23096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:25:33, skipping insertion in model container [2024-10-24 07:25:33,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:25:10" (2/3) ... [2024-10-24 07:25:33,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf23096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:25:33, skipping insertion in model container [2024-10-24 07:25:33,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:25:33" (3/3) ... [2024-10-24 07:25:33,301 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-24 07:25:33,316 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:25:33,316 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:25:33,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:25:33,379 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;@10b85f57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:25:33,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:25:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 07:25:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 07:25:33,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:33,422 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:25:33,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:33,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 991443149, now seen corresponding path program 1 times [2024-10-24 07:25:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:25:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443246529] [2024-10-24 07:25:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:33,446 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-10-24 07:25:33,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:25:33,453 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-10-24 07:25:33,458 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-10-24 07:25:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:34,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:25:34,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:25:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-24 07:25:34,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:25:34,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:25:34,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443246529] [2024-10-24 07:25:34,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443246529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:25:34,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:25:34,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:25:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438066256] [2024-10-24 07:25:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:25:34,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:25:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:25:34,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:25:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:25:34,923 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 07:25:39,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:25:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:39,426 INFO L93 Difference]: Finished difference Result 162 states and 295 transitions. [2024-10-24 07:25:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:25:39,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2024-10-24 07:25:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:39,619 INFO L225 Difference]: With dead ends: 162 [2024-10-24 07:25:39,620 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 07:25:39,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 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-10-24 07:25:39,626 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:39,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-24 07:25:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 07:25:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-24 07:25:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 07:25:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 127 transitions. [2024-10-24 07:25:39,666 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 127 transitions. Word has length 183 [2024-10-24 07:25:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:39,667 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 127 transitions. [2024-10-24 07:25:39,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 07:25:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 127 transitions. [2024-10-24 07:25:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 07:25:39,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:39,671 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:25:39,711 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-10-24 07:25:39,875 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-10-24 07:25:39,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:39,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:39,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1100034435, now seen corresponding path program 1 times [2024-10-24 07:25:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:25:39,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878149304] [2024-10-24 07:25:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:39,877 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-10-24 07:25:39,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:25:39,897 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-10-24 07:25:39,899 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-10-24 07:25:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:41,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:25:41,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:25:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 07:25:47,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:25:47,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:25:47,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878149304] [2024-10-24 07:25:47,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878149304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:25:47,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:25:47,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:25:47,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607991149] [2024-10-24 07:25:47,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:25:47,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:25:47,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:25:47,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:25:47,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:25:47,688 INFO L87 Difference]: Start difference. First operand 80 states and 127 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 07:25:52,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:25:56,380 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-10-24 07:25:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:25:56,693 INFO L93 Difference]: Finished difference Result 215 states and 342 transitions. [2024-10-24 07:25:56,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:25:56,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-24 07:25:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:25:56,697 INFO L225 Difference]: With dead ends: 215 [2024-10-24 07:25:56,697 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 07:25:56,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:25:56,699 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:25:56,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 232 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-10-24 07:25:56,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 07:25:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-10-24 07:25:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-24 07:25:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 211 transitions. [2024-10-24 07:25:56,744 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 211 transitions. Word has length 183 [2024-10-24 07:25:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:25:56,745 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 211 transitions. [2024-10-24 07:25:56,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 07:25:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 211 transitions. [2024-10-24 07:25:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-24 07:25:56,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:25:56,752 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 07:25:56,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 07:25:56,953 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-10-24 07:25:56,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:25:56,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:25:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 43013255, now seen corresponding path program 1 times [2024-10-24 07:25:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:25:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983424059] [2024-10-24 07:25:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:25:56,957 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-10-24 07:25:56,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:25:56,960 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-10-24 07:25:56,962 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-10-24 07:25:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:25:58,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 07:25:58,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 810 proven. 33 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-24 07:26:08,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:26:08,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:26:08,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983424059] [2024-10-24 07:26:08,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983424059] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [357450702] [2024-10-24 07:26:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:08,905 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 07:26:08,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 07:26:08,909 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 07:26:08,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-24 07:26:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:11,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:26:11,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 810 proven. 33 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-24 07:26:20,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:26:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [357450702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:21,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:26:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-24 07:26:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867688248] [2024-10-24 07:26:21,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:26:21,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:26:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:26:21,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:26:21,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:26:21,279 INFO L87 Difference]: Start difference. First operand 134 states and 211 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 07:26:30,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:26:34,474 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 []