/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/ldv-regression/test23-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 03:13:54,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 03:13:54,255 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-21 03:13:54,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 03:13:54,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 03:13:54,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 03:13:54,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 03:13:54,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 03:13:54,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 03:13:54,296 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 03:13:54,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 03:13:54,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 03:13:54,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 03:13:54,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 03:13:54,298 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 03:13:54,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 03:13:54,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 03:13:54,299 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 03:13:54,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 03:13:54,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 03:13:54,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 03:13:54,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 03:13:54,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 03:13:54,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 03:13:54,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 03:13:54,302 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 03:13:54,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 03:13:54,302 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 03:13:54,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 03:13:54,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 03:13:54,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 03:13:54,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 03:13:54,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:13:54,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 03:13:54,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 03:13:54,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 03:13:54,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 03:13:54,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 03:13:54,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 03:13:54,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 03:13:54,306 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 03:13:54,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 03:13:54,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 03:13:54,306 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-21 03:13:54,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 03:13:54,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 03:13:54,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 03:13:54,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 03:13:54,562 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 03:13:54,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test23-1.c [2023-12-21 03:13:55,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 03:13:55,875 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 03:13:55,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-1.c [2023-12-21 03:13:55,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8877cbb5a/b253a05a542d44fbab4acc78cfe8dabf/FLAGc2c693653 [2023-12-21 03:13:55,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8877cbb5a/b253a05a542d44fbab4acc78cfe8dabf [2023-12-21 03:13:55,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 03:13:55,902 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 03:13:55,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 03:13:55,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 03:13:55,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 03:13:55,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:13:55" (1/1) ... [2023-12-21 03:13:55,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19009a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:55, skipping insertion in model container [2023-12-21 03:13:55,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:13:55" (1/1) ... [2023-12-21 03:13:55,935 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 03:13:56,063 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-1.c[1075,1088] [2023-12-21 03:13:56,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:13:56,077 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 03:13:56,094 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23-1.c[1075,1088] [2023-12-21 03:13:56,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 03:13:56,111 INFO L206 MainTranslator]: Completed translation [2023-12-21 03:13:56,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56 WrapperNode [2023-12-21 03:13:56,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 03:13:56,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 03:13:56,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 03:13:56,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 03:13:56,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,142 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-12-21 03:13:56,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 03:13:56,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 03:13:56,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 03:13:56,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 03:13:56,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,175 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2023-12-21 03:13:56,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 03:13:56,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 03:13:56,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 03:13:56,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 03:13:56,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (1/1) ... [2023-12-21 03:13:56,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 03:13:56,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:13:56,226 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-21 03:13:56,250 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-21 03:13:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 03:13:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 03:13:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 03:13:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 03:13:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 03:13:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2023-12-21 03:13:56,258 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2023-12-21 03:13:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 03:13:56,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 03:13:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 03:13:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 03:13:56,351 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 03:13:56,353 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 03:13:56,503 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 03:13:56,545 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 03:13:56,546 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 03:13:56,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:13:56 BoogieIcfgContainer [2023-12-21 03:13:56,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 03:13:56,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 03:13:56,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 03:13:56,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 03:13:56,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:13:55" (1/3) ... [2023-12-21 03:13:56,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6700421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:13:56, skipping insertion in model container [2023-12-21 03:13:56,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:13:56" (2/3) ... [2023-12-21 03:13:56,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6700421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:13:56, skipping insertion in model container [2023-12-21 03:13:56,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:13:56" (3/3) ... [2023-12-21 03:13:56,554 INFO L112 eAbstractionObserver]: Analyzing ICFG test23-1.c [2023-12-21 03:13:56,571 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 03:13:56,572 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 03:13:56,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 03:13:56,618 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;@243c69d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 03:13:56,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 03:13:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:13:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-21 03:13:56,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:13:56,630 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:13:56,631 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:13:56,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:13:56,635 INFO L85 PathProgramCache]: Analyzing trace with hash -35949440, now seen corresponding path program 1 times [2023-12-21 03:13:56,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:13:56,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313875826] [2023-12-21 03:13:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:13:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:13:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:56,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:13:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:56,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:13:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:13:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:13:56,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313875826] [2023-12-21 03:13:56,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313875826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:13:56,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:13:56,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 03:13:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268843525] [2023-12-21 03:13:56,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:13:56,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 03:13:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:13:56,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 03:13:56,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 03:13:56,917 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:13:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:13:56,956 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2023-12-21 03:13:56,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 03:13:56,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2023-12-21 03:13:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:13:56,963 INFO L225 Difference]: With dead ends: 24 [2023-12-21 03:13:56,963 INFO L226 Difference]: Without dead ends: 14 [2023-12-21 03:13:56,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-21 03:13:56,968 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:13:56,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:13:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-21 03:13:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-21 03:13:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:13:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-21 03:13:56,996 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 14 [2023-12-21 03:13:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:13:56,997 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-21 03:13:56,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:13:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-21 03:13:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 03:13:56,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:13:56,998 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:13:56,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 03:13:56,999 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:13:56,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:13:57,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1121744136, now seen corresponding path program 1 times [2023-12-21 03:13:57,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:13:57,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590905058] [2023-12-21 03:13:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:13:57,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:13:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:13:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:57,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:13:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:13:57,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:13:57,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590905058] [2023-12-21 03:13:57,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590905058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 03:13:57,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 03:13:57,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 03:13:57,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082766741] [2023-12-21 03:13:57,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 03:13:57,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 03:13:57,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:13:57,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 03:13:57,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 03:13:57,419 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:13:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:13:57,468 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2023-12-21 03:13:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 03:13:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-12-21 03:13:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:13:57,469 INFO L225 Difference]: With dead ends: 20 [2023-12-21 03:13:57,469 INFO L226 Difference]: Without dead ends: 16 [2023-12-21 03:13:57,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-21 03:13:57,470 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 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-21 03:13:57,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:13:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-21 03:13:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-21 03:13:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:13:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-12-21 03:13:57,475 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2023-12-21 03:13:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:13:57,476 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-12-21 03:13:57,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:13:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-12-21 03:13:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 03:13:57,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:13:57,477 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:13:57,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 03:13:57,477 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:13:57,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:13:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash 68065171, now seen corresponding path program 1 times [2023-12-21 03:13:57,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:13:57,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876983231] [2023-12-21 03:13:57,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:13:57,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:13:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:13:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:13:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:13:57,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:13:57,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876983231] [2023-12-21 03:13:57,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876983231] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:13:57,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864291693] [2023-12-21 03:13:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:13:57,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:13:57,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:13:57,800 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-21 03:13:57,829 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-21 03:13:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:57,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 03:13:57,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:13:58,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2023-12-21 03:13:58,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 03:13:58,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2023-12-21 03:13:58,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:13:58,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:13:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:13:58,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864291693] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:13:58,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:13:58,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2023-12-21 03:13:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537292853] [2023-12-21 03:13:58,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:13:58,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 03:13:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:13:58,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 03:13:58,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-21 03:13:58,215 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:13:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:13:58,287 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-12-21 03:13:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 03:13:58,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-21 03:13:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:13:58,289 INFO L225 Difference]: With dead ends: 26 [2023-12-21 03:13:58,289 INFO L226 Difference]: Without dead ends: 22 [2023-12-21 03:13:58,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-12-21 03:13:58,290 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:13:58,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 31 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:13:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-21 03:13:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-21 03:13:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:13:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-12-21 03:13:58,295 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2023-12-21 03:13:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:13:58,295 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-12-21 03:13:58,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:13:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-12-21 03:13:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 03:13:58,296 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:13:58,296 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:13:58,305 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-21 03:13:58,502 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-21 03:13:58,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:13:58,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:13:58,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1001513756, now seen corresponding path program 2 times [2023-12-21 03:13:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:13:58,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044694271] [2023-12-21 03:13:58,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:13:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:13:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:58,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:13:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:58,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:13:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:13:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:13:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044694271] [2023-12-21 03:13:58,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044694271] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:13:58,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885977811] [2023-12-21 03:13:58,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 03:13:58,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:13:58,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:13:58,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:13:58,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 03:13:58,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 03:13:58,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:13:58,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 03:13:58,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:13:58,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2023-12-21 03:13:58,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-21 03:13:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:13:58,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:13:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:13:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885977811] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:13:59,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:13:59,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2023-12-21 03:13:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590951736] [2023-12-21 03:13:59,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:13:59,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 03:13:59,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:13:59,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 03:13:59,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2023-12-21 03:13:59,113 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:13:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:13:59,294 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2023-12-21 03:13:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 03:13:59,294 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-12-21 03:13:59,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:13:59,296 INFO L225 Difference]: With dead ends: 38 [2023-12-21 03:13:59,296 INFO L226 Difference]: Without dead ends: 34 [2023-12-21 03:13:59,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=407, Unknown=0, NotChecked=0, Total=650 [2023-12-21 03:13:59,298 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:13:59,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:13:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-21 03:13:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-21 03:13:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:13:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-12-21 03:13:59,310 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 23 [2023-12-21 03:13:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:13:59,310 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-12-21 03:13:59,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:13:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-12-21 03:13:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 03:13:59,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:13:59,312 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:13:59,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 03:13:59,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-21 03:13:59,518 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:13:59,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:13:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1451472198, now seen corresponding path program 3 times [2023-12-21 03:13:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:13:59,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759908337] [2023-12-21 03:13:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:13:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:13:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:59,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 03:13:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-21 03:13:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 03:13:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:13:59,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 03:13:59,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759908337] [2023-12-21 03:13:59,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759908337] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 03:13:59,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860033572] [2023-12-21 03:13:59,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 03:13:59,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:13:59,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 03:13:59,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 03:13:59,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 03:14:00,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-21 03:14:00,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 03:14:00,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 03:14:00,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 03:14:00,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 1 [2023-12-21 03:14:00,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 03:14:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:14:00,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 03:14:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 03:14:00,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860033572] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 03:14:00,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 03:14:00,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 16 [2023-12-21 03:14:00,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447182959] [2023-12-21 03:14:00,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 03:14:00,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 03:14:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 03:14:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 03:14:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2023-12-21 03:14:00,334 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:14:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 03:14:00,491 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2023-12-21 03:14:00,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 03:14:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-12-21 03:14:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 03:14:00,493 INFO L225 Difference]: With dead ends: 40 [2023-12-21 03:14:00,493 INFO L226 Difference]: Without dead ends: 36 [2023-12-21 03:14:00,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 12 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2023-12-21 03:14:00,494 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 03:14:00,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 03:14:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-21 03:14:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-21 03:14:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 03:14:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2023-12-21 03:14:00,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 35 [2023-12-21 03:14:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 03:14:00,500 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2023-12-21 03:14:00,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 03:14:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2023-12-21 03:14:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 03:14:00,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 03:14:00,501 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 03:14:00,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 03:14:00,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 03:14:00,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 03:14:00,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 03:14:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash -972200351, now seen corresponding path program 4 times [2023-12-21 03:14:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 03:14:00,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131375428] [2023-12-21 03:14:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 03:14:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 03:14:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 03:14:00,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 03:14:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 03:14:00,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 03:14:00,814 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 03:14:00,814 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 03:14:00,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 03:14:00,818 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2023-12-21 03:14:00,822 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 03:14:00,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 03:14:00 BoogieIcfgContainer [2023-12-21 03:14:00,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 03:14:00,877 INFO L158 Benchmark]: Toolchain (without parser) took 4975.03ms. Allocated memory was 233.8MB in the beginning and 290.5MB in the end (delta: 56.6MB). Free memory was 183.2MB in the beginning and 218.9MB in the end (delta: -35.8MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. [2023-12-21 03:14:00,877 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:14:00,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.14ms. Allocated memory is still 233.8MB. Free memory was 182.8MB in the beginning and 171.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 03:14:00,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.94ms. Allocated memory is still 233.8MB. Free memory was 171.6MB in the beginning and 169.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:14:00,878 INFO L158 Benchmark]: Boogie Preprocessor took 45.22ms. Allocated memory is still 233.8MB. Free memory was 169.9MB in the beginning and 167.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 03:14:00,878 INFO L158 Benchmark]: RCFGBuilder took 357.50ms. Allocated memory is still 233.8MB. Free memory was 167.8MB in the beginning and 153.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 03:14:00,878 INFO L158 Benchmark]: TraceAbstraction took 4327.93ms. Allocated memory was 233.8MB in the beginning and 290.5MB in the end (delta: 56.6MB). Free memory was 152.3MB in the beginning and 218.9MB in the end (delta: -66.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 03:14:00,879 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 185.6MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.14ms. Allocated memory is still 233.8MB. Free memory was 182.8MB in the beginning and 171.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.94ms. Allocated memory is still 233.8MB. Free memory was 171.6MB in the beginning and 169.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.22ms. Allocated memory is still 233.8MB. Free memory was 169.9MB in the beginning and 167.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 357.50ms. Allocated memory is still 233.8MB. Free memory was 167.8MB in the beginning and 153.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4327.93ms. Allocated memory was 233.8MB in the beginning and 290.5MB in the end (delta: 56.6MB). Free memory was 152.3MB in the beginning and 218.9MB in the end (delta: -66.6MB). There was no memory consumed. 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 - CounterExampleResult [Line: 52]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L35] CALL init() [L16] d1.a = __VERIFIER_nondet_int() [L17] d1.b = __VERIFIER_nondet_int() [L19] d2.a = __VERIFIER_nondet_int() [L20] d2.b = __VERIFIER_nondet_int() [L35] RET init() [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, pd1={4:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L37] int i = __VERIFIER_nondet_int(); [L38] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L39] pd2->array[i] = i [L40] int *pa = &pd1->array[i]; [L41] EXPR pd2->array[i] [L41] i = pd2->array[i] - 10 [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-3, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-2, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-1, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=0, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=1, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=2, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=3, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=4, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=5, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=6, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=7, pa={4:32}, pd1={4:0}, pd2={4:0}] [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND FALSE !(i <= *pa) [L45] CALL, EXPR check(pd2, i) [L30] EXPR s1->array[i] [L30] return s1->array[i] == i; [L45] RET, EXPR check(pd2, i) [L45] COND TRUE !check(pd2, i) [L52] reach_error() VAL [d1={4:0}, d2={5:0}, i=7, pa={4:32}, pd1={4:0}, pd2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 55 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 148 SyntacticMatches, 14 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=5, InterpolantAutomatonStates: 62, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 1223 SizeOfPredicates, 37 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 22/418 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 proved your program to be incorrect! [2023-12-21 03:14:00,908 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...