/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:50:35,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:50:35,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:50:35,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:50:35,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:50:35,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:50:35,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:50:35,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:50:35,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:50:35,795 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:50:35,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:50:35,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:50:35,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:50:35,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:50:35,797 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:50:35,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:50:35,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:50:35,797 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:50:35,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:50:35,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:50:35,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:50:35,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:50:35,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:50:35,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:50:35,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:50:35,799 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:50:35,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:50:35,800 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:50:35,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:50:35,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:50:35,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:50:35,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:50:35,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:50:35,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:50:35,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:50:35,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:50:35,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:50:35,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:50:35,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:50:35,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:50:35,802 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:50:35,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:50:35,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:50:35,803 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: Use bitabs translation -> false [2023-12-16 03:50:35,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:50:36,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:50:36,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:50:36,006 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:50:36,007 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:50:36,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-30.i [2023-12-16 03:50:37,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:50:37,228 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:50:37,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-30.i [2023-12-16 03:50:37,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/879ed88da/6564641d4d334438af14f5bee03b78db/FLAGc4a3432ee [2023-12-16 03:50:37,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/879ed88da/6564641d4d334438af14f5bee03b78db [2023-12-16 03:50:37,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:50:37,256 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:50:37,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:50:37,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:50:37,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:50:37,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c4a3ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37, skipping insertion in model container [2023-12-16 03:50:37,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,292 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:50:37,412 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-30.i[915,928] [2023-12-16 03:50:37,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:50:37,468 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:50:37,477 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-30.i[915,928] [2023-12-16 03:50:37,501 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:50:37,512 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:50:37,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37 WrapperNode [2023-12-16 03:50:37,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:50:37,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:50:37,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:50:37,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:50:37,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,548 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2023-12-16 03:50:37,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:50:37,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:50:37,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:50:37,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:50:37,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,575 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]. [2023-12-16 03:50:37,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:50:37,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:50:37,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:50:37,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:50:37,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (1/1) ... [2023-12-16 03:50:37,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:50:37,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:50:37,623 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) [2023-12-16 03:50:37,643 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 [2023-12-16 03:50:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:50:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:50:37,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:50:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:50:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:50:37,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:50:37,722 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:50:37,725 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:50:37,966 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:50:37,989 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:50:37,990 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:50:37,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:50:37 BoogieIcfgContainer [2023-12-16 03:50:37,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:50:37,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:50:37,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:50:37,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:50:37,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:50:37" (1/3) ... [2023-12-16 03:50:37,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1572fd10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:50:37, skipping insertion in model container [2023-12-16 03:50:37,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:50:37" (2/3) ... [2023-12-16 03:50:37,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1572fd10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:50:37, skipping insertion in model container [2023-12-16 03:50:37,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:50:37" (3/3) ... [2023-12-16 03:50:37,997 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-30.i [2023-12-16 03:50:38,009 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:50:38,009 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:50:38,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:50:38,054 INFO L357 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, mHoare=true, 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;@418c6f90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:50:38,054 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:50:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 03:50:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 03:50:38,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:50:38,065 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:50:38,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:50:38,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:50:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash -969944696, now seen corresponding path program 1 times [2023-12-16 03:50:38,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:50:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326495550] [2023-12-16 03:50:38,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:50:38,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:50:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:50:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:50:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:50:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:50:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:50:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:50:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:50:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:50:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:50:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:50:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 03:50:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:50:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326495550] [2023-12-16 03:50:38,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326495550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:50:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:50:38,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:50:38,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845245034] [2023-12-16 03:50:38,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:50:38,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:50:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:50:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:50:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:50:38,380 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 03:50:38,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:50:38,413 INFO L93 Difference]: Finished difference Result 93 states and 156 transitions. [2023-12-16 03:50:38,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:50:38,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 74 [2023-12-16 03:50:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:50:38,420 INFO L225 Difference]: With dead ends: 93 [2023-12-16 03:50:38,421 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 03:50:38,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:50:38,428 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:50:38,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:50:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 03:50:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-16 03:50:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 03:50:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2023-12-16 03:50:38,457 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 74 [2023-12-16 03:50:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:50:38,458 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2023-12-16 03:50:38,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 03:50:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2023-12-16 03:50:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 03:50:38,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:50:38,460 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:50:38,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:50:38,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:50:38,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:50:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1089170224, now seen corresponding path program 1 times [2023-12-16 03:50:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:50:38,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420842965] [2023-12-16 03:50:38,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:50:38,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:50:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:50:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:50:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:50:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:50:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:50:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:50:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:50:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:50:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:50:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:50:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 03:50:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:50:38,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420842965] [2023-12-16 03:50:38,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420842965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:50:38,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:50:38,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:50:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282468109] [2023-12-16 03:50:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:50:38,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:50:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:50:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:50:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:50:38,829 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 03:50:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:50:38,984 INFO L93 Difference]: Finished difference Result 156 states and 236 transitions. [2023-12-16 03:50:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:50:38,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2023-12-16 03:50:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:50:38,989 INFO L225 Difference]: With dead ends: 156 [2023-12-16 03:50:38,989 INFO L226 Difference]: Without dead ends: 111 [2023-12-16 03:50:38,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:50:38,991 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 83 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:50:38,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 209 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:50:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-16 03:50:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2023-12-16 03:50:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:50:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2023-12-16 03:50:39,029 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 74 [2023-12-16 03:50:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:50:39,029 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2023-12-16 03:50:39,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 03:50:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2023-12-16 03:50:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-16 03:50:39,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:50:39,031 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:50:39,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:50:39,032 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:50:39,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:50:39,032 INFO L85 PathProgramCache]: Analyzing trace with hash -385202843, now seen corresponding path program 1 times [2023-12-16 03:50:39,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:50:39,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15714151] [2023-12-16 03:50:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:50:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:50:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:50:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:50:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:50:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:50:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:50:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:50:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:50:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:50:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:50:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:50:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-16 03:50:39,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:50:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15714151] [2023-12-16 03:50:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15714151] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:50:39,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525128305] [2023-12-16 03:50:39,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:50:39,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:50:39,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:50:39,745 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) [2023-12-16 03:50:39,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 03:50:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:39,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 03:50:39,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:50:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 03:50:39,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:50:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-16 03:50:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525128305] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:50:40,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:50:40,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2023-12-16 03:50:40,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373139373] [2023-12-16 03:50:40,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:50:40,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 03:50:40,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:50:40,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 03:50:40,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-12-16 03:50:40,024 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 03:50:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:50:40,417 INFO L93 Difference]: Finished difference Result 330 states and 481 transitions. [2023-12-16 03:50:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 03:50:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) Word has length 75 [2023-12-16 03:50:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:50:40,419 INFO L225 Difference]: With dead ends: 330 [2023-12-16 03:50:40,419 INFO L226 Difference]: Without dead ends: 242 [2023-12-16 03:50:40,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2023-12-16 03:50:40,421 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 233 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 03:50:40,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 404 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 03:50:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-16 03:50:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 191. [2023-12-16 03:50:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 142 states have (on average 1.3380281690140845) internal successors, (190), 142 states have internal predecessors, (190), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-16 03:50:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 270 transitions. [2023-12-16 03:50:40,445 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 270 transitions. Word has length 75 [2023-12-16 03:50:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:50:40,446 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 270 transitions. [2023-12-16 03:50:40,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.916666666666667) internal successors, (59), 13 states have internal predecessors, (59), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-16 03:50:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 270 transitions. [2023-12-16 03:50:40,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 03:50:40,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:50:40,449 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:50:40,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 03:50:40,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:50:40,656 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:50:40,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:50:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash 929418474, now seen corresponding path program 1 times [2023-12-16 03:50:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:50:40,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434324366] [2023-12-16 03:50:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:50:40,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:50:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:50:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:50:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:50:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:50:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:50:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:50:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:50:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:50:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:50:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:50:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 03:50:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:50:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434324366] [2023-12-16 03:50:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434324366] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:50:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:50:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:50:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609034179] [2023-12-16 03:50:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:50:40,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:50:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:50:40,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:50:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:50:40,712 INFO L87 Difference]: Start difference. First operand 191 states and 270 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 03:50:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:50:40,738 INFO L93 Difference]: Finished difference Result 381 states and 539 transitions. [2023-12-16 03:50:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:50:40,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2023-12-16 03:50:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:50:40,740 INFO L225 Difference]: With dead ends: 381 [2023-12-16 03:50:40,740 INFO L226 Difference]: Without dead ends: 191 [2023-12-16 03:50:40,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:50:40,742 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:50:40,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 96 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:50:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-16 03:50:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2023-12-16 03:50:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 142 states have (on average 1.3098591549295775) internal successors, (186), 142 states have internal predecessors, (186), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-16 03:50:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 266 transitions. [2023-12-16 03:50:40,774 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 266 transitions. Word has length 76 [2023-12-16 03:50:40,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:50:40,774 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 266 transitions. [2023-12-16 03:50:40,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 03:50:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 266 transitions. [2023-12-16 03:50:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-16 03:50:40,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:50:40,776 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:50:40,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:50:40,776 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:50:40,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:50:40,776 INFO L85 PathProgramCache]: Analyzing trace with hash 603389436, now seen corresponding path program 1 times [2023-12-16 03:50:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:50:40,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289959276] [2023-12-16 03:50:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:50:40,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:50:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:50:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:50:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:50:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:50:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:50:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:50:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:50:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:50:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:50:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:50:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:50:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 03:50:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:50:40,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289959276] [2023-12-16 03:50:40,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289959276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:50:40,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:50:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:50:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148178286] [2023-12-16 03:50:40,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:50:40,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:50:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:50:40,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:50:40,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:50:40,948 INFO L87 Difference]: Start difference. First operand 191 states and 266 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 03:50:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:50:40,977 INFO L93 Difference]: Finished difference Result 381 states and 531 transitions. [2023-12-16 03:50:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:50:40,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 77 [2023-12-16 03:50:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:50:40,979 INFO L225 Difference]: With dead ends: 381 [2023-12-16 03:50:40,979 INFO L226 Difference]: Without dead ends: 191 [2023-12-16 03:50:40,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:50:40,980 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 15 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:50:40,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 140 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:50:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-16 03:50:40,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2023-12-16 03:50:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 142 states have internal predecessors, (182), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-16 03:50:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 262 transitions. [2023-12-16 03:50:40,997 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 262 transitions. Word has length 77 [2023-12-16 03:50:40,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:50:40,997 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 262 transitions. [2023-12-16 03:50:40,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 03:50:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 262 transitions. [2023-12-16 03:50:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-16 03:50:40,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:50:40,998 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:50:40,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:50:40,998 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:50:40,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:50:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash -97675142, now seen corresponding path program 1 times [2023-12-16 03:50:40,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:50:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916483692] [2023-12-16 03:50:40,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:50:40,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:50:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:50:41,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:50:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:50:41,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:50:41,084 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:50:41,084 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:50:41,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 03:50:41,087 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 03:50:41,090 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:50:41,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:50:41 BoogieIcfgContainer [2023-12-16 03:50:41,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:50:41,134 INFO L158 Benchmark]: Toolchain (without parser) took 3878.53ms. Allocated memory was 334.5MB in the beginning and 401.6MB in the end (delta: 67.1MB). Free memory was 290.3MB in the beginning and 293.9MB in the end (delta: -3.6MB). Peak memory consumption was 64.7MB. Max. memory is 8.0GB. [2023-12-16 03:50:41,134 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 182.5MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:50:41,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.89ms. Allocated memory is still 334.5MB. Free memory was 290.3MB in the beginning and 277.0MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 03:50:41,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.32ms. Allocated memory is still 334.5MB. Free memory was 277.0MB in the beginning and 274.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:50:41,135 INFO L158 Benchmark]: Boogie Preprocessor took 50.12ms. Allocated memory is still 334.5MB. Free memory was 274.9MB in the beginning and 272.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:50:41,135 INFO L158 Benchmark]: RCFGBuilder took 390.98ms. Allocated memory is still 334.5MB. Free memory was 272.5MB in the beginning and 256.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 03:50:41,135 INFO L158 Benchmark]: TraceAbstraction took 3141.67ms. Allocated memory was 334.5MB in the beginning and 401.6MB in the end (delta: 67.1MB). Free memory was 255.4MB in the beginning and 293.9MB in the end (delta: -38.5MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. [2023-12-16 03:50:41,136 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.45ms. Allocated memory is still 182.5MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 255.89ms. Allocated memory is still 334.5MB. Free memory was 290.3MB in the beginning and 277.0MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.32ms. Allocated memory is still 334.5MB. Free memory was 277.0MB in the beginning and 274.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.12ms. Allocated memory is still 334.5MB. Free memory was 274.9MB in the beginning and 272.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 390.98ms. Allocated memory is still 334.5MB. Free memory was 272.5MB in the beginning and 256.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3141.67ms. Allocated memory was 334.5MB in the beginning and 401.6MB in the end (delta: 67.1MB). Free memory was 255.4MB in the beginning and 293.9MB in the end (delta: -38.5MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of bitwise operation at line 64, overapproximation of someBinaryArithmeticDOUBLEoperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] unsigned char last_1_var_1_1 = 1; [L36] signed long int last_1_var_1_11 = -2; [L37] signed long int last_1_var_1_15 = 1000; [L38] double last_1_var_1_16 = 0.2; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L114] last_1_var_1_1 = var_1_1 [L115] last_1_var_1_11 = var_1_11 [L116] last_1_var_1_15 = var_1_15 [L117] last_1_var_1_16 = var_1_16 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L96] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L97] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L97] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L98] var_1_7 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L99] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L100] var_1_10 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L101] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L102] var_1_13 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L103] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L104] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L104] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L105] var_1_14 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L106] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L107] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L107] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L108] var_1_17 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L109] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L110] var_1_18 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L111] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L128] RET updateVariables() [L129] CALL step() [L42] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L43] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L44] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L49] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L50] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L51] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L53] signed long int stepLocal_2 = var_1_11; [L54] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=999, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L55] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=999, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L56] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=999, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L57] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L58] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=999, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L64] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=999, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L64] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L75] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=999, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1003, var_1_16=1/5, var_1_1=1, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L77] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L78] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=999, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1003, var_1_1=1, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L82] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=999, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1003, var_1_1=1, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L83] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L84] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=999, var_1_10=100000000000004, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1003, var_1_1=1, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) [L120] EXPR var_1_11 & var_1_13 [L120] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1003, var_1_1=1, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L120-L121] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1003, var_1_1=1, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=999, var_1_13=1003, var_1_14=999, var_1_15=1003, var_1_1=1, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 349 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 915 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 582 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 333 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=3, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 73 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 528 NumberOfCodeBlocks, 528 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 519 ConstructedInterpolants, 0 QuantifiedInterpolants, 1638 SizeOfPredicates, 2 NumberOfNonLiveVariables, 207 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 1179/1260 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 [2023-12-16 03:50:41,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...