/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_25-while_file-60.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:47:32,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:47:32,921 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:47:32,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:47:32,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:47:32,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:47:32,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:47:32,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:47:32,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:47:32,957 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:47:32,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:47:32,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:47:32,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:47:32,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:47:32,959 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:47:32,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:47:32,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:47:32,960 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:47:32,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:47:32,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:47:32,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:47:32,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:47:32,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:47:32,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:47:32,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:47:32,961 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:47:32,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:47:32,962 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:47:32,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:47:32,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:47:32,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:47:32,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:47:32,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:47:32,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:47:32,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:47:32,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:47:32,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:47:32,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:47:32,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:47:32,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:47:32,964 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:47:32,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:47:32,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:47:32,965 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:47:33,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:47:33,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:47:33,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:47:33,183 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:47:33,184 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:47:33,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-60.i [2023-12-16 03:47:34,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:47:34,598 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:47:34,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-60.i [2023-12-16 03:47:34,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b128ef0c7/cf23bc71eb204d8b8b8e1c544f222533/FLAG65c25ab1e [2023-12-16 03:47:34,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b128ef0c7/cf23bc71eb204d8b8b8e1c544f222533 [2023-12-16 03:47:34,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:47:34,621 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:47:34,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:47:34,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:47:34,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:47:34,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fc5a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34, skipping insertion in model container [2023-12-16 03:47:34,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,653 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:47:34,778 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_25-while_file-60.i[915,928] [2023-12-16 03:47:34,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:47:34,810 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:47:34,819 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_25-while_file-60.i[915,928] [2023-12-16 03:47:34,833 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:47:34,844 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:47:34,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34 WrapperNode [2023-12-16 03:47:34,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:47:34,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:47:34,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:47:34,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:47:34,850 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:47:34" (1/1) ... [2023-12-16 03:47:34,857 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:47:34" (1/1) ... [2023-12-16 03:47:34,877 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2023-12-16 03:47:34,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:47:34,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:47:34,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:47:34,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:47:34,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,912 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:47:34,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:47:34,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:47:34,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:47:34,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:47:34,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (1/1) ... [2023-12-16 03:47:34,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:47:34,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:47:34,966 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:47:34,975 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:47:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:47:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:47:34,993 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:47:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:47:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:47:34,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:47:35,062 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:47:35,066 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:47:35,269 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:47:35,292 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:47:35,292 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:47:35,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:47:35 BoogieIcfgContainer [2023-12-16 03:47:35,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:47:35,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:47:35,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:47:35,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:47:35,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:47:34" (1/3) ... [2023-12-16 03:47:35,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389f6595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:47:35, skipping insertion in model container [2023-12-16 03:47:35,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:47:34" (2/3) ... [2023-12-16 03:47:35,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389f6595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:47:35, skipping insertion in model container [2023-12-16 03:47:35,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:47:35" (3/3) ... [2023-12-16 03:47:35,298 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-60.i [2023-12-16 03:47:35,308 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:47:35,309 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:47:35,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:47:35,340 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;@77c36f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:47:35,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:47:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 03:47:35,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 03:47:35,347 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:47:35,348 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:47:35,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:47:35,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:47:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1393358701, now seen corresponding path program 1 times [2023-12-16 03:47:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:47:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435935792] [2023-12-16 03:47:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:47:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:47:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:47:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:47:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:47:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 03:47:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 03:47:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 03:47:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 03:47:35,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:47:35,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435935792] [2023-12-16 03:47:35,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435935792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:47:35,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:47:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:47:35,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288770845] [2023-12-16 03:47:35,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:47:35,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:47:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:47:35,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:47:35,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:47:35,552 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 03:47:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:47:35,603 INFO L93 Difference]: Finished difference Result 60 states and 94 transitions. [2023-12-16 03:47:35,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:47:35,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-12-16 03:47:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:47:35,608 INFO L225 Difference]: With dead ends: 60 [2023-12-16 03:47:35,608 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 03:47:35,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:47:35,615 INFO L413 NwaCegarLoop]: 35 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, 35 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:47:35,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:47:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 03:47:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 03:47:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 03:47:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-12-16 03:47:35,644 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 45 [2023-12-16 03:47:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:47:35,645 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-12-16 03:47:35,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 03:47:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-12-16 03:47:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 03:47:35,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:47:35,648 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:47:35,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:47:35,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:47:35,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:47:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1174731551, now seen corresponding path program 1 times [2023-12-16 03:47:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:47:35,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104773157] [2023-12-16 03:47:35,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:47:35,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:47:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:47:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:47:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:47:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 03:47:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 03:47:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 03:47:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 03:47:35,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:47:35,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104773157] [2023-12-16 03:47:35,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104773157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:47:35,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:47:35,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:47:35,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971847356] [2023-12-16 03:47:35,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:47:35,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:47:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:47:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:47:35,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:47:35,895 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 03:47:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:47:35,923 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2023-12-16 03:47:35,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:47:35,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2023-12-16 03:47:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:47:35,925 INFO L225 Difference]: With dead ends: 57 [2023-12-16 03:47:35,925 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 03:47:35,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:47:35,927 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:47:35,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:47:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 03:47:35,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 03:47:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-16 03:47:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2023-12-16 03:47:35,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 45 [2023-12-16 03:47:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:47:35,935 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-12-16 03:47:35,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 03:47:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2023-12-16 03:47:35,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 03:47:35,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:47:35,936 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 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:47:35,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:47:35,937 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:47:35,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:47:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash -954505827, now seen corresponding path program 1 times [2023-12-16 03:47:35,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:47:35,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134088862] [2023-12-16 03:47:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:47:35,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:47:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:36,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:47:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:47:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:36,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 03:47:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:36,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 03:47:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:36,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 03:47:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 03:47:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:47:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 03:47:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:47:36,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134088862] [2023-12-16 03:47:36,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134088862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:47:36,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:47:36,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:47:36,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608455740] [2023-12-16 03:47:36,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:47:36,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:47:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:47:36,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:47:36,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:47:36,092 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 03:47:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:47:36,167 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2023-12-16 03:47:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:47:36,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2023-12-16 03:47:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:47:36,169 INFO L225 Difference]: With dead ends: 93 [2023-12-16 03:47:36,169 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 03:47:36,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:47:36,170 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:47:36,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 103 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:47:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 03:47:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2023-12-16 03:47:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 03:47:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2023-12-16 03:47:36,180 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 46 [2023-12-16 03:47:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:47:36,180 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2023-12-16 03:47:36,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-16 03:47:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2023-12-16 03:47:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 03:47:36,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:47:36,181 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 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:47:36,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:47:36,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:47:36,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:47:36,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2120951549, now seen corresponding path program 1 times [2023-12-16 03:47:36,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:47:36,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274528354] [2023-12-16 03:47:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:47:36,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:47:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:47:36,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:47:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:47:36,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:47:36,276 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:47:36,276 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:47:36,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:47:36,281 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-16 03:47:36,283 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:47:36,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:47:36 BoogieIcfgContainer [2023-12-16 03:47:36,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:47:36,325 INFO L158 Benchmark]: Toolchain (without parser) took 1703.50ms. Allocated memory is still 188.7MB. Free memory was 143.0MB in the beginning and 98.7MB in the end (delta: 44.3MB). Peak memory consumption was 45.3MB. Max. memory is 8.0GB. [2023-12-16 03:47:36,325 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:47:36,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.42ms. Allocated memory is still 188.7MB. Free memory was 142.5MB in the beginning and 130.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 03:47:36,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.55ms. Allocated memory is still 188.7MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:47:36,326 INFO L158 Benchmark]: Boogie Preprocessor took 51.54ms. Allocated memory is still 188.7MB. Free memory was 128.4MB in the beginning and 125.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:47:36,326 INFO L158 Benchmark]: RCFGBuilder took 355.51ms. Allocated memory is still 188.7MB. Free memory was 125.9MB in the beginning and 111.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 03:47:36,327 INFO L158 Benchmark]: TraceAbstraction took 1030.95ms. Allocated memory is still 188.7MB. Free memory was 110.6MB in the beginning and 98.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2023-12-16 03:47:36,336 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.12ms. Allocated memory is still 188.7MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.42ms. Allocated memory is still 188.7MB. Free memory was 142.5MB in the beginning and 130.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.55ms. Allocated memory is still 188.7MB. Free memory was 130.5MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.54ms. Allocated memory is still 188.7MB. Free memory was 128.4MB in the beginning and 125.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 355.51ms. Allocated memory is still 188.7MB. Free memory was 125.9MB in the beginning and 111.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1030.95ms. Allocated memory is still 188.7MB. Free memory was 110.6MB in the beginning and 98.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.8MB. 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 78, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.6; [L23] double var_1_2 = 64.25; [L24] double var_1_3 = 31.2; [L25] signed long int var_1_4 = 1; [L26] float var_1_7 = 100.5; [L27] float var_1_9 = 50.2; [L28] float var_1_10 = 0.125; [L29] float var_1_11 = 9999999999999.8; [L30] float var_1_12 = 3.5; [L31] unsigned short int var_1_13 = 0; [L32] double last_1_var_1_1 = 9999.6; [L33] unsigned short int last_1_var_1_13 = 0; [L82] isInitial = 1 [L83] FCALL initially() [L84] COND TRUE 1 [L85] CALL updateLastVariables() [L74] last_1_var_1_1 = var_1_1 [L75] last_1_var_1_13 = var_1_13 [L85] RET updateLastVariables() [L86] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L61] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L64] var_1_9 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L65] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L66] var_1_10 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L67] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L68] var_1_11 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L69] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L70] var_1_12 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L71] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L86] RET updateVariables() [L87] CALL step() [L37] COND TRUE (- last_1_var_1_13) >= last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L38] COND FALSE !(last_1_var_1_13 > last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L46] COND TRUE -4 < var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L47] COND TRUE var_1_11 <= (24.6f * var_1_9) [L48] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=1, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L51] var_1_1 = (var_1_2 - var_1_3) [L52] signed long int stepLocal_0 = var_1_13 + var_1_4; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, stepLocal_0=2, var_1_13=1, var_1_4=1, var_1_7=201/2] [L53] COND FALSE !(stepLocal_0 < var_1_4) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, stepLocal_0=2, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L87] RET step() [L88] CALL, EXPR property() [L78-L79] return (((var_1_1 == ((double) (var_1_2 - var_1_3))) && (((- last_1_var_1_13) >= last_1_var_1_13) ? ((last_1_var_1_13 > last_1_var_1_13) ? ((var_1_3 == last_1_var_1_1) ? (var_1_4 == ((signed long int) last_1_var_1_13)) : (var_1_4 == ((signed long int) last_1_var_1_13))) : 1) : 1)) && (((var_1_13 + var_1_4) < var_1_4) ? (var_1_7 == ((float) (((((var_1_3 - (var_1_9 + var_1_10))) < ((var_1_11 + var_1_12))) ? ((var_1_3 - (var_1_9 + var_1_10))) : ((var_1_11 + var_1_12)))))) : (var_1_7 == ((float) var_1_11)))) && ((-4 < var_1_4) ? ((var_1_11 <= (24.6f * var_1_9)) ? (var_1_13 == ((unsigned short int) var_1_4)) : 1) : 1) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 167 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 103 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 180/180 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:47:36,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...