./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.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 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:25:10,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:25:10,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:25:10,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:25:10,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:25:10,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:25:10,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:25:10,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:25:10,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:25:10,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:25:10,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:25:10,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:25:10,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:25:10,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:25:10,144 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:25:10,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:25:10,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:25:10,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:25:10,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:25:10,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:25:10,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:25:10,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:25:10,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:25:10,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:25:10,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:25:10,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:25:10,148 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:25:10,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:25:10,148 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:25:10,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:25:10,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:25:10,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:25:10,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:10,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:25:10,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:25:10,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:25:10,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:25:10,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:25:10,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:25:10,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:25:10,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:25:10,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:25:10,152 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 -> 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd [2024-11-08 23:25:10,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:25:10,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:25:10,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:25:10,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:25:10,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:25:10,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-11-08 23:25:11,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:25:11,904 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:25:11,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-11-08 23:25:11,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255dabb29/d887fa54faa3405a8668253c812f35e8/FLAGe2fd8b738 [2024-11-08 23:25:12,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255dabb29/d887fa54faa3405a8668253c812f35e8 [2024-11-08 23:25:12,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:25:12,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:25:12,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:12,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:25:12,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:25:12,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb08f4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12, skipping insertion in model container [2024-11-08 23:25:12,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:25:12,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i[916,929] [2024-11-08 23:25:12,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:12,539 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:25:12,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i[916,929] [2024-11-08 23:25:12,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:12,604 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:25:12,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12 WrapperNode [2024-11-08 23:25:12,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:12,605 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:12,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:25:12,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:25:12,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,684 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-11-08 23:25:12,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:12,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:25:12,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:25:12,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:25:12,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,759 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:25:12,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:25:12,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:25:12,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:25:12,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:25:12,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (1/1) ... [2024-11-08 23:25:12,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:12,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:25:12,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:25:12,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:25:12,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:25:12,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:25:12,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:25:12,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:25:12,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:25:12,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:25:12,990 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:25:12,994 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:25:13,333 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-08 23:25:13,333 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:25:13,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:25:13,345 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:25:13,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:13 BoogieIcfgContainer [2024-11-08 23:25:13,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:25:13,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:25:13,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:25:13,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:25:13,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:25:12" (1/3) ... [2024-11-08 23:25:13,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fc6ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:13, skipping insertion in model container [2024-11-08 23:25:13,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:12" (2/3) ... [2024-11-08 23:25:13,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fc6ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:13, skipping insertion in model container [2024-11-08 23:25:13,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:13" (3/3) ... [2024-11-08 23:25:13,354 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-11-08 23:25:13,367 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:25:13,367 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:25:13,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:25:13,435 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;@44542ee0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:25:13,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:25:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:25:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:25:13,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:13,459 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:25:13,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:13,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash 643814027, now seen corresponding path program 1 times [2024-11-08 23:25:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:13,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484360961] [2024-11-08 23:25:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:25:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:25:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:25:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:25:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 23:25:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 23:25:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 23:25:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:25:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:25:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:25:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:25:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:25:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:25:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:25:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:25:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:25:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:25:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:25:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:25:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:25:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:25:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:13,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:13,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484360961] [2024-11-08 23:25:13,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484360961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:13,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:13,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:25:13,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574691389] [2024-11-08 23:25:13,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:13,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:25:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:13,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:25:13,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:25:13,873 INFO L87 Difference]: Start difference. First operand has 81 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:25:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:13,897 INFO L93 Difference]: Finished difference Result 159 states and 268 transitions. [2024-11-08 23:25:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:25:13,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 154 [2024-11-08 23:25:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:13,905 INFO L225 Difference]: With dead ends: 159 [2024-11-08 23:25:13,907 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 23:25:13,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:25:13,914 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:13,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 23:25:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 23:25:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:25:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-08 23:25:13,964 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 154 [2024-11-08 23:25:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:13,966 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-08 23:25:13,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:25:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-08 23:25:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:25:13,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:13,969 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:25:13,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:25:13,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1818668177, now seen corresponding path program 1 times [2024-11-08 23:25:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:13,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221733095] [2024-11-08 23:25:13,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:13,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:25:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:25:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:25:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:25:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 23:25:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 23:25:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 23:25:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:25:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:25:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:25:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:25:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:25:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:25:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:25:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:25:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:25:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:25:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:25:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:25:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:25:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:25:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:14,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221733095] [2024-11-08 23:25:14,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221733095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:14,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:14,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:25:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134722839] [2024-11-08 23:25:14,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:14,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:25:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:14,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:25:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:14,281 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:14,341 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2024-11-08 23:25:14,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:25:14,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-11-08 23:25:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:14,344 INFO L225 Difference]: With dead ends: 189 [2024-11-08 23:25:14,344 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 23:25:14,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:14,348 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 47 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:14,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 246 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 23:25:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-11-08 23:25:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 79 states have internal predecessors, (104), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:25:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 166 transitions. [2024-11-08 23:25:14,378 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 166 transitions. Word has length 154 [2024-11-08 23:25:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:14,379 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 166 transitions. [2024-11-08 23:25:14,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 166 transitions. [2024-11-08 23:25:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:25:14,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:14,381 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:25:14,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:25:14,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:14,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash -701291757, now seen corresponding path program 1 times [2024-11-08 23:25:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:14,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359873383] [2024-11-08 23:25:14,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:25:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:25:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:25:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:25:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 23:25:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 23:25:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 23:25:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:25:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:25:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:25:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:25:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:25:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:25:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:25:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:25:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:25:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:25:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:25:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:25:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:25:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:25:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359873383] [2024-11-08 23:25:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359873383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:14,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:14,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:25:14,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615264088] [2024-11-08 23:25:14,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:14,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:25:14,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:25:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:14,629 INFO L87 Difference]: Start difference. First operand 112 states and 166 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:14,681 INFO L93 Difference]: Finished difference Result 221 states and 329 transitions. [2024-11-08 23:25:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:25:14,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-11-08 23:25:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:14,685 INFO L225 Difference]: With dead ends: 221 [2024-11-08 23:25:14,685 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 23:25:14,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:14,687 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:14,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:14,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 23:25:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 23:25:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 79 states have internal predecessors, (103), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:25:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 165 transitions. [2024-11-08 23:25:14,712 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 165 transitions. Word has length 154 [2024-11-08 23:25:14,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:14,712 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 165 transitions. [2024-11-08 23:25:14,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 165 transitions. [2024-11-08 23:25:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:25:14,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:14,714 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:25:14,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:25:14,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:14,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash 309825493, now seen corresponding path program 1 times [2024-11-08 23:25:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924467117] [2024-11-08 23:25:14,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:25:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:25:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:25:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:25:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 23:25:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 23:25:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 23:25:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:25:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:25:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:25:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:25:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:25:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:25:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:25:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:25:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:25:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:25:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:25:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:25:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:25:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:25:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924467117] [2024-11-08 23:25:15,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924467117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:15,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:15,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:25:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595083936] [2024-11-08 23:25:15,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:15,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:25:15,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:15,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:25:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:25:15,220 INFO L87 Difference]: Start difference. First operand 112 states and 165 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:15,282 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2024-11-08 23:25:15,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:25:15,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-11-08 23:25:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:15,286 INFO L225 Difference]: With dead ends: 223 [2024-11-08 23:25:15,286 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 23:25:15,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:25:15,288 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 47 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:15,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 382 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 23:25:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2024-11-08 23:25:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 78 states have internal predecessors, (101), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:25:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-11-08 23:25:15,309 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 154 [2024-11-08 23:25:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:15,309 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-11-08 23:25:15,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-11-08 23:25:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:25:15,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:15,315 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:25:15,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:25:15,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:15,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash 907555931, now seen corresponding path program 1 times [2024-11-08 23:25:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:15,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688703693] [2024-11-08 23:25:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 23:25:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 23:25:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 23:25:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 23:25:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 23:25:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 23:25:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 23:25:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 23:25:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 23:25:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 23:25:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:25:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:25:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:25:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:25:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:25:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:25:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:25:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:25:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:25:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 23:25:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:25:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:15,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:15,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688703693] [2024-11-08 23:25:15,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688703693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:15,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:15,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:25:15,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127432326] [2024-11-08 23:25:15,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:15,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:25:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:15,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:25:15,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:25:15,870 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:16,302 INFO L93 Difference]: Finished difference Result 503 states and 739 transitions. [2024-11-08 23:25:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:25:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-11-08 23:25:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:16,306 INFO L225 Difference]: With dead ends: 503 [2024-11-08 23:25:16,308 INFO L226 Difference]: Without dead ends: 395 [2024-11-08 23:25:16,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:25:16,311 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 281 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:16,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 496 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:25:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-08 23:25:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 227. [2024-11-08 23:25:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 160 states have (on average 1.3375) internal successors, (214), 162 states have internal predecessors, (214), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 23:25:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 338 transitions. [2024-11-08 23:25:16,373 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 338 transitions. Word has length 154 [2024-11-08 23:25:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:16,373 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 338 transitions. [2024-11-08 23:25:16,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 338 transitions. [2024-11-08 23:25:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:25:16,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:16,375 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:25:16,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:25:16,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:16,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash 909402973, now seen corresponding path program 1 times [2024-11-08 23:25:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073928730] [2024-11-08 23:25:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:25:16,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821721539] [2024-11-08 23:25:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:16,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:25:16,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:25:16,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:25:16,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:25:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:25:16,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:25:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:25:16,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:25:16,734 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:25:16,735 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:25:16,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:25:16,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 23:25:16,940 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 23:25:17,054 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:25:17,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:25:17 BoogieIcfgContainer [2024-11-08 23:25:17,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:25:17,057 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:25:17,057 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:25:17,061 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:25:17,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:13" (3/4) ... [2024-11-08 23:25:17,065 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:25:17,066 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:25:17,066 INFO L158 Benchmark]: Toolchain (without parser) took 4753.81ms. Allocated memory was 192.9MB in the beginning and 316.7MB in the end (delta: 123.7MB). Free memory was 124.1MB in the beginning and 245.4MB in the end (delta: -121.3MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-08 23:25:17,067 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 192.9MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:25:17,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.94ms. Allocated memory is still 192.9MB. Free memory was 123.8MB in the beginning and 105.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:25:17,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.28ms. Allocated memory is still 192.9MB. Free memory was 105.5MB in the beginning and 99.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:25:17,067 INFO L158 Benchmark]: Boogie Preprocessor took 154.61ms. Allocated memory is still 192.9MB. Free memory was 99.7MB in the beginning and 158.7MB in the end (delta: -59.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:25:17,067 INFO L158 Benchmark]: RCFGBuilder took 505.88ms. Allocated memory is still 192.9MB. Free memory was 157.7MB in the beginning and 128.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 23:25:17,068 INFO L158 Benchmark]: TraceAbstraction took 3709.12ms. Allocated memory was 192.9MB in the beginning and 316.7MB in the end (delta: 123.7MB). Free memory was 128.4MB in the beginning and 245.4MB in the end (delta: -117.1MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-08 23:25:17,068 INFO L158 Benchmark]: Witness Printer took 8.94ms. Allocated memory is still 316.7MB. Free memory is still 245.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:25:17,071 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.17ms. Allocated memory is still 192.9MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.94ms. Allocated memory is still 192.9MB. Free memory was 123.8MB in the beginning and 105.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.28ms. Allocated memory is still 192.9MB. Free memory was 105.5MB in the beginning and 99.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 154.61ms. Allocated memory is still 192.9MB. Free memory was 99.7MB in the beginning and 158.7MB in the end (delta: -59.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 505.88ms. Allocated memory is still 192.9MB. Free memory was 157.7MB in the beginning and 128.4MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3709.12ms. Allocated memory was 192.9MB in the beginning and 316.7MB in the end (delta: 123.7MB). Free memory was 128.4MB in the beginning and 245.4MB in the end (delta: -117.1MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Witness Printer took 8.94ms. Allocated memory is still 316.7MB. Free memory is still 245.4MB. 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 183, overapproximation of someBinaryArithmeticDOUBLEoperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryArithmeticFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99999999999.75; [L23] float var_1_4 = 31.25; [L24] float var_1_5 = 0.0; [L25] float var_1_6 = 99.5; [L26] float var_1_7 = 500.5; [L27] double var_1_8 = 199.96; [L28] double var_1_9 = 256.95; [L29] signed long int var_1_11 = 1523382513; [L30] double var_1_14 = 32.6; [L31] double var_1_15 = 0.875; [L32] unsigned short int var_1_16 = 1; [L33] unsigned char var_1_17 = 1; [L34] float var_1_18 = 0.3; [L35] signed short int var_1_19 = 4; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_24 = 0; [L38] unsigned char var_1_25 = 16; [L39] unsigned char var_1_26 = 5; [L40] signed short int var_1_27 = 64; [L41] unsigned char var_1_28 = 1; [L42] float var_1_29 = 64.5; [L43] float var_1_30 = 0.0; [L44] unsigned long int var_1_31 = 2; [L45] unsigned long int var_1_32 = 1140371764; [L46] unsigned long int var_1_33 = 3119542188; [L47] double var_1_34 = 10.5; [L48] unsigned short int last_1_var_1_16 = 1; [L49] signed short int last_1_var_1_19 = 4; [L50] signed short int last_1_var_1_27 = 64; [L51] float last_1_var_1_29 = 64.5; [L52] unsigned long int last_1_var_1_31 = 2; VAL [isInitial=0, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_4=125/4, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L187] isInitial = 1 [L188] FCALL initially() [L189] int k_loop; [L190] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_4=125/4, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L190] COND TRUE k_loop < 1 [L191] CALL updateLastVariables() [L176] last_1_var_1_16 = var_1_16 [L177] last_1_var_1_19 = var_1_19 [L178] last_1_var_1_27 = var_1_27 [L179] last_1_var_1_29 = var_1_29 [L180] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_4=125/4, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L191] RET updateLastVariables() [L192] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L137] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L138] var_1_5 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L139] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L140] var_1_6 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L141] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L142] var_1_7 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L143] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L144] var_1_11 = __VERIFIER_nondet_long() [L145] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L145] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L147] var_1_14 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L148] RET assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L149] var_1_15 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L150] RET assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L151] var_1_17 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L152] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L154] var_1_20 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L158] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] CALL assume_abort_if_not(var_1_25 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] RET assume_abort_if_not(var_1_25 <= 64) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L160] var_1_26 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L161] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L163] var_1_28 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L164] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L166] var_1_30 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L167] RET assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L168] var_1_32 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_32 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L169] RET assume_abort_if_not(var_1_32 >= 1073741824) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L171] var_1_33 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_33 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L172] RET assume_abort_if_not(var_1_33 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L192] RET updateVariables() [L193] CALL step() [L56] unsigned long int stepLocal_1 = last_1_var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L57] COND FALSE !(var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) [L64] var_1_8 = var_1_7 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L66] COND FALSE !(! var_1_20) [L73] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L75] signed long int stepLocal_6 = (((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24)); [L76] unsigned char stepLocal_5 = var_1_28; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, stepLocal_6=0, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L77] COND FALSE !(stepLocal_6 < var_1_25) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L82] signed long int stepLocal_0 = ~ var_1_24; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_0=-1, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L83] COND TRUE stepLocal_0 <= var_1_24 [L84] var_1_1 = (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L86] var_1_29 = (var_1_6 + ((var_1_30 - 7.6f) - var_1_7)) [L87] var_1_31 = ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26) [L88] unsigned char stepLocal_3 = var_1_24; [L89] unsigned long int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-2, stepLocal_3=0, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L90] COND FALSE !(\read(var_1_17)) [L97] var_1_16 = var_1_27 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-2, stepLocal_3=0, stepLocal_5=1, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L99] signed long int stepLocal_8 = ~ var_1_16; [L100] signed long int stepLocal_7 = var_1_24 / var_1_11; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-2, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, stepLocal_8=-65, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L101] COND FALSE !(stepLocal_8 > var_1_31) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-2, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L108] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-2, stepLocal_3=0, stepLocal_4=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L109] COND FALSE !(stepLocal_4 && var_1_20) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-2, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L116] COND FALSE !((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) [L123] var_1_19 = ((var_1_16 + var_1_24) + 16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-2, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L126] COND TRUE (var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24) [L127] var_1_9 = (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-2, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2] [L131] COND FALSE !(var_1_19 <= var_1_16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=-2, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2] [L193] RET step() [L194] CALL, EXPR property() [L183-L184] return ((((((((((((~ var_1_24) <= var_1_24) ? (var_1_1 == ((float) (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))))) : 1) && ((var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((last_1_var_1_19 < last_1_var_1_31) ? (var_1_8 == ((double) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7))) : (var_1_8 == ((double) var_1_4))) : (var_1_8 == ((double) var_1_7)))) && (((var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24)) ? (var_1_9 == ((double) (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))))) : (var_1_9 == ((double) (var_1_7 - var_1_5))))) && (var_1_17 ? ((var_1_11 <= var_1_24) ? ((var_1_24 <= var_1_31) ? (var_1_16 == ((unsigned short int) var_1_27)) : 1) : 1) : (var_1_16 == ((unsigned short int) var_1_27)))) && ((var_1_19 <= var_1_16) ? (var_1_18 == ((float) (var_1_15 + 64.4f))) : 1)) && ((var_1_17 && var_1_20) ? (var_1_17 ? (var_1_19 == ((signed short int) ((var_1_16 - var_1_24) + 50))) : (var_1_19 == ((signed short int) ((((var_1_24) > (var_1_16)) ? (var_1_24) : (var_1_16)))))) : (((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) ? ((var_1_14 == var_1_8) ? (var_1_19 == ((signed short int) var_1_16)) : (var_1_19 == ((signed short int) (var_1_16 + var_1_24)))) : (var_1_19 == ((signed short int) ((var_1_16 + var_1_24) + 16)))))) && ((! var_1_20) ? ((last_1_var_1_16 <= last_1_var_1_16) ? (var_1_24 == ((unsigned char) ((var_1_25 + 1) + var_1_26))) : (var_1_24 == ((unsigned char) var_1_26))) : (var_1_24 == ((unsigned char) var_1_26)))) && ((((((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24))) < var_1_25) ? (((var_1_20 || var_1_17) && var_1_28) ? (var_1_27 == ((signed short int) (((((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) < (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))))) ? ((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) : (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))))) : 1) : 1)) && (var_1_29 == ((float) (var_1_6 + ((var_1_30 - 7.6f) - var_1_7))))) && (var_1_31 == ((unsigned long int) ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26)))) && (((~ var_1_16) > var_1_31) ? (((var_1_24 / var_1_11) >= var_1_26) ? (var_1_34 == ((double) ((((((-5.2001036938992108E18) < 0 ) ? -(-5.2001036938992108E18) : (-5.2001036938992108E18))) - 50.25) - var_1_4))) : (var_1_34 == ((double) var_1_7))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2] [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=-2, var_1_32=5368709120, var_1_33=-2, var_1_34=21/2, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 375 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 1454 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 762 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 197 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 692 mSDtfsCounter, 197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 174 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1078 NumberOfCodeBlocks, 1078 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 765 ConstructedInterpolants, 0 QuantifiedInterpolants, 1095 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5060/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:25:17,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.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 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:25:19,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:25:19,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:25:19,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:25:19,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:25:19,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:25:19,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:25:19,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:25:19,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:25:19,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:25:19,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:25:19,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:25:19,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:25:19,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:25:19,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:25:19,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:25:19,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:25:19,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:25:19,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:25:19,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:25:19,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:25:19,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:25:19,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:25:19,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:25:19,389 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:25:19,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:25:19,391 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:25:19,391 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:25:19,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:25:19,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:25:19,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:25:19,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:25:19,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:25:19,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:25:19,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:19,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:25:19,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:25:19,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:25:19,392 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:25:19,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:25:19,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:25:19,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:25:19,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:25:19,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:25:19,395 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 -> 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd [2024-11-08 23:25:19,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:25:19,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:25:19,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:25:19,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:25:19,682 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:25:19,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-11-08 23:25:21,115 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:25:21,306 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:25:21,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-11-08 23:25:21,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0dea98c/a113fbd16ac54ce5b1691ba9f9b0041a/FLAGcc44e9df5 [2024-11-08 23:25:21,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c0dea98c/a113fbd16ac54ce5b1691ba9f9b0041a [2024-11-08 23:25:21,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:25:21,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:25:21,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:21,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:25:21,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:25:21,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:21" (1/1) ... [2024-11-08 23:25:21,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6857df6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:21, skipping insertion in model container [2024-11-08 23:25:21,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:21" (1/1) ... [2024-11-08 23:25:21,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:25:21,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i[916,929] [2024-11-08 23:25:21,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:22,002 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:25:22,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i[916,929] [2024-11-08 23:25:22,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:22,081 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:25:22,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22 WrapperNode [2024-11-08 23:25:22,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:22,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:22,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:25:22,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:25:22,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,136 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-08 23:25:22,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:22,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:25:22,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:25:22,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:25:22,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,172 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:25:22,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:25:22,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:25:22,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:25:22,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:25:22,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (1/1) ... [2024-11-08 23:25:22,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:25:22,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:25:22,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:25:22,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:25:22,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:25:22,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:25:22,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:25:22,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:25:22,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:25:22,365 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:25:22,368 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:25:31,990 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-08 23:25:31,990 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:25:32,014 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:25:32,014 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:25:32,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:32 BoogieIcfgContainer [2024-11-08 23:25:32,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:25:32,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:25:32,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:25:32,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:25:32,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:25:21" (1/3) ... [2024-11-08 23:25:32,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146f6771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:32, skipping insertion in model container [2024-11-08 23:25:32,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:22" (2/3) ... [2024-11-08 23:25:32,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146f6771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:32, skipping insertion in model container [2024-11-08 23:25:32,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:32" (3/3) ... [2024-11-08 23:25:32,027 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-11-08 23:25:32,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:25:32,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:25:32,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:25:32,113 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;@25c26d37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:25:32,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:25:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:25:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:25:32,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:32,135 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:25:32,135 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:32,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 643814027, now seen corresponding path program 1 times [2024-11-08 23:25:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:25:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667189516] [2024-11-08 23:25:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:32,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:25:32,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:25:32,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:25:32,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:25:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:32,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:25:32,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:25:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-08 23:25:33,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:25:33,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:25:33,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667189516] [2024-11-08 23:25:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667189516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:33,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:33,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:25:33,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680015049] [2024-11-08 23:25:33,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:33,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:25:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:25:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:25:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:25:33,079 INFO L87 Difference]: Start difference. First operand has 81 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:25:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:33,111 INFO L93 Difference]: Finished difference Result 159 states and 268 transitions. [2024-11-08 23:25:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:25:33,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 154 [2024-11-08 23:25:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:33,122 INFO L225 Difference]: With dead ends: 159 [2024-11-08 23:25:33,122 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 23:25:33,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:25:33,130 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:33,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 23:25:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 23:25:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:25:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-08 23:25:33,178 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 154 [2024-11-08 23:25:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:33,179 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-08 23:25:33,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:25:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-08 23:25:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:25:33,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:33,183 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:25:33,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:25:33,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:25:33,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:33,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1818668177, now seen corresponding path program 1 times [2024-11-08 23:25:33,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:25:33,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720274794] [2024-11-08 23:25:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:33,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:25:33,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:25:33,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:25:33,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:25:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:34,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:25:34,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:25:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:34,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:25:34,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:25:34,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720274794] [2024-11-08 23:25:34,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720274794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:34,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:34,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:25:34,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025201837] [2024-11-08 23:25:34,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:34,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:25:34,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:25:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:25:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:34,189 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:38,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:25:42,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:25:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:42,716 INFO L93 Difference]: Finished difference Result 151 states and 229 transitions. [2024-11-08 23:25:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:25:42,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-11-08 23:25:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:42,802 INFO L225 Difference]: With dead ends: 151 [2024-11-08 23:25:42,802 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 23:25:42,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:42,808 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:42,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2024-11-08 23:25:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 23:25:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 23:25:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:25:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-08 23:25:42,824 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 154 [2024-11-08 23:25:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:42,831 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-08 23:25:42,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-08 23:25:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:25:42,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:42,840 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:25:42,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:25:43,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:25:43,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:43,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:43,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1465181869, now seen corresponding path program 1 times [2024-11-08 23:25:43,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:25:43,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147429538] [2024-11-08 23:25:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:43,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:25:43,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:25:43,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:25:43,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:25:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:43,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:25:43,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:25:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-08 23:25:46,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:25:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:47,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:25:47,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147429538] [2024-11-08 23:25:47,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147429538] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 23:25:47,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:25:47,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2024-11-08 23:25:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496378701] [2024-11-08 23:25:47,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:47,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:25:47,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:25:47,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:25:47,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:25:47,123 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:51,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:25:55,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:25:59,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:03,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:03,779 INFO L93 Difference]: Finished difference Result 188 states and 278 transitions. [2024-11-08 23:26:03,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:26:03,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-11-08 23:26:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:03,781 INFO L225 Difference]: With dead ends: 188 [2024-11-08 23:26:03,781 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 23:26:03,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:26:03,782 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 47 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:03,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 382 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2024-11-08 23:26:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 23:26:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2024-11-08 23:26:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 78 states have internal predecessors, (101), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:26:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-11-08 23:26:03,803 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 154 [2024-11-08 23:26:03,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:03,804 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-11-08 23:26:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:26:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-11-08 23:26:03,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 23:26:03,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:03,808 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:26:03,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:26:04,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:26:04,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:04,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash 907555931, now seen corresponding path program 1 times [2024-11-08 23:26:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:26:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715686256] [2024-11-08 23:26:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:04,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:26:04,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:26:04,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:26:04,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 23:26:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:04,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:26:04,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-08 23:26:10,102 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:26:12,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:26:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715686256] [2024-11-08 23:26:12,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715686256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:26:12,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1071879439] [2024-11-08 23:26:12,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:12,074 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:26:12,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:26:12,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:26:12,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 23:26:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:14,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 23:26:14,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-08 23:26:18,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:26:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1071879439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:26:19,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:26:19,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-08 23:26:19,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069234308] [2024-11-08 23:26:19,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:26:19,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:26:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:26:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:26:19,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:26:19,708 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:26:28,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:29,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:33,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:26:37,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:26:40,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:26:47,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:26:51,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]