/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/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 04:00:42,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 04:00:42,969 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 04:00:42,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 04:00:42,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 04:00:42,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 04:00:42,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 04:00:42,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 04:00:42,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 04:00:42,991 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 04:00:42,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 04:00:42,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 04:00:42,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 04:00:42,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 04:00:42,992 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 04:00:42,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 04:00:42,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 04:00:42,993 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 04:00:42,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 04:00:42,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 04:00:42,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 04:00:43,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 04:00:43,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 04:00:43,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 04:00:43,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 04:00:43,005 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 04:00:43,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 04:00:43,005 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 04:00:43,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 04:00:43,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 04:00:43,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 04:00:43,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 04:00:43,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 04:00:43,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 04:00:43,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 04:00:43,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 04:00:43,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 04:00:43,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 04:00:43,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 04:00:43,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 04:00:43,008 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 04:00:43,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 04:00:43,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 04:00:43,008 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 04:00:43,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 04:00:43,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 04:00:43,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 04:00:43,227 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 04:00:43,228 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 04:00:43,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2023-12-21 04:00:44,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 04:00:44,470 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 04:00:44,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2023-12-21 04:00:44,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5baff11/5e837b594d344886ab12b50fe1459057/FLAG0305f9c79 [2023-12-21 04:00:44,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5baff11/5e837b594d344886ab12b50fe1459057 [2023-12-21 04:00:44,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 04:00:44,488 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 04:00:44,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 04:00:44,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 04:00:44,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 04:00:44,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@176bb12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44, skipping insertion in model container [2023-12-21 04:00:44,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,513 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 04:00:44,632 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2023-12-21 04:00:44,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 04:00:44,657 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 04:00:44,665 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2023-12-21 04:00:44,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 04:00:44,679 INFO L206 MainTranslator]: Completed translation [2023-12-21 04:00:44,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44 WrapperNode [2023-12-21 04:00:44,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 04:00:44,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 04:00:44,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 04:00:44,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 04:00:44,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,706 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2023-12-21 04:00:44,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 04:00:44,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 04:00:44,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 04:00:44,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 04:00:44,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,727 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 2, 4]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2023-12-21 04:00:44,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 04:00:44,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 04:00:44,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 04:00:44,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 04:00:44,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (1/1) ... [2023-12-21 04:00:44,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 04:00:44,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:00:44,773 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 04:00:44,778 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 04:00:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 04:00:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 04:00:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 04:00:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 04:00:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 04:00:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 04:00:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 04:00:44,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 04:00:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 04:00:44,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 04:00:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 04:00:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 04:00:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 04:00:44,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 04:00:44,848 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 04:00:44,849 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 04:00:45,011 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 04:00:45,035 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 04:00:45,035 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 04:00:45,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:00:45 BoogieIcfgContainer [2023-12-21 04:00:45,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 04:00:45,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 04:00:45,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 04:00:45,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 04:00:45,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 04:00:44" (1/3) ... [2023-12-21 04:00:45,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52530a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:00:45, skipping insertion in model container [2023-12-21 04:00:45,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 04:00:44" (2/3) ... [2023-12-21 04:00:45,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52530a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 04:00:45, skipping insertion in model container [2023-12-21 04:00:45,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 04:00:45" (3/3) ... [2023-12-21 04:00:45,042 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2023-12-21 04:00:45,056 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 04:00:45,056 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 04:00:45,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 04:00:45,095 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;@72b07b91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 04:00:45,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 04:00:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-21 04:00:45,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:00:45,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:00:45,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:00:45,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:00:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1223517790, now seen corresponding path program 1 times [2023-12-21 04:00:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:00:45,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945459512] [2023-12-21 04:00:45,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:45,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:00:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:00:45,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:00:45,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945459512] [2023-12-21 04:00:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945459512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 04:00:45,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 04:00:45,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 04:00:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467215734] [2023-12-21 04:00:45,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 04:00:45,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 04:00:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:00:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 04:00:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 04:00:45,576 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:00:45,632 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2023-12-21 04:00:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 04:00:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-21 04:00:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:00:45,638 INFO L225 Difference]: With dead ends: 23 [2023-12-21 04:00:45,638 INFO L226 Difference]: Without dead ends: 11 [2023-12-21 04:00:45,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:00:45,643 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 04:00:45,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 04:00:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-21 04:00:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-21 04:00:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-21 04:00:45,666 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2023-12-21 04:00:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:00:45,667 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-21 04:00:45,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-21 04:00:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 04:00:45,667 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:00:45,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:00:45,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 04:00:45,668 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:00:45,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:00:45,668 INFO L85 PathProgramCache]: Analyzing trace with hash 440511619, now seen corresponding path program 1 times [2023-12-21 04:00:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:00:45,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160440784] [2023-12-21 04:00:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:45,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:00:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 04:00:45,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:00:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160440784] [2023-12-21 04:00:45,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160440784] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 04:00:45,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 04:00:45,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 04:00:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476037410] [2023-12-21 04:00:45,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 04:00:45,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 04:00:45,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:00:45,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 04:00:45,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 04:00:45,824 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:00:45,852 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2023-12-21 04:00:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 04:00:45,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 04:00:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:00:45,853 INFO L225 Difference]: With dead ends: 21 [2023-12-21 04:00:45,853 INFO L226 Difference]: Without dead ends: 12 [2023-12-21 04:00:45,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 04:00:45,855 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 04:00:45,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 04:00:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-21 04:00:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-21 04:00:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-21 04:00:45,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2023-12-21 04:00:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:00:45,863 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-21 04:00:45,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-21 04:00:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 04:00:45,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:00:45,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:00:45,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 04:00:45,865 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:00:45,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:00:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash -316658865, now seen corresponding path program 1 times [2023-12-21 04:00:45,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:00:45,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300565897] [2023-12-21 04:00:45,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:00:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 04:00:46,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:00:46,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300565897] [2023-12-21 04:00:46,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300565897] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:00:46,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869722558] [2023-12-21 04:00:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:46,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:00:46,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:00:46,105 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 04:00:46,119 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 04:00:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:46,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-21 04:00:46,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:00:46,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 43 [2023-12-21 04:00:46,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2023-12-21 04:00:46,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2023-12-21 04:00:46,381 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 15 treesize of output 11 [2023-12-21 04:00:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 04:00:46,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:00:46,703 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 27 treesize of output 25 [2023-12-21 04:00:46,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 28 [2023-12-21 04:00:46,722 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 26 treesize of output 24 [2023-12-21 04:00:46,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 24 [2023-12-21 04:00:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 04:00:46,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869722558] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:00:46,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:00:46,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 15 [2023-12-21 04:00:46,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272386833] [2023-12-21 04:00:46,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:00:46,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 04:00:46,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:00:46,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 04:00:46,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-21 04:00:46,761 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:00:47,421 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2023-12-21 04:00:47,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 04:00:47,421 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 04:00:47,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:00:47,423 INFO L225 Difference]: With dead ends: 52 [2023-12-21 04:00:47,423 INFO L226 Difference]: Without dead ends: 43 [2023-12-21 04:00:47,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 04:00:47,426 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 88 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 04:00:47,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 39 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 04:00:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-21 04:00:47,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 18. [2023-12-21 04:00:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-12-21 04:00:47,438 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-12-21 04:00:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:00:47,438 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-12-21 04:00:47,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-12-21 04:00:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 04:00:47,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:00:47,438 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:00:47,444 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 04:00:47,643 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 04:00:47,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:00:47,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:00:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash -401541789, now seen corresponding path program 2 times [2023-12-21 04:00:47,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:00:47,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427454140] [2023-12-21 04:00:47,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:47,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:00:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 04:00:47,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:00:47,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427454140] [2023-12-21 04:00:47,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427454140] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:00:47,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784579983] [2023-12-21 04:00:47,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 04:00:47,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:00:47,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:00:47,881 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 04:00:47,905 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 04:00:47,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 04:00:47,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:00:47,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-21 04:00:47,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:00:48,069 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 17 treesize of output 13 [2023-12-21 04:00:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 04:00:48,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:00:48,310 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 26 treesize of output 18 [2023-12-21 04:00:48,312 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 18 treesize of output 16 [2023-12-21 04:00:48,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 20 [2023-12-21 04:00:48,320 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 27 treesize of output 19 [2023-12-21 04:00:48,323 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 19 treesize of output 17 [2023-12-21 04:00:48,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 24 [2023-12-21 04:00:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 04:00:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784579983] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:00:48,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:00:48,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 23 [2023-12-21 04:00:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541058139] [2023-12-21 04:00:48,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:00:48,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 04:00:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:00:48,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 04:00:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2023-12-21 04:00:48,429 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:49,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:00:49,888 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2023-12-21 04:00:49,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-21 04:00:49,888 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 04:00:49,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:00:49,889 INFO L225 Difference]: With dead ends: 64 [2023-12-21 04:00:49,889 INFO L226 Difference]: Without dead ends: 55 [2023-12-21 04:00:49,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2023-12-21 04:00:49,890 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 125 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 04:00:49,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 139 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 04:00:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-21 04:00:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 22. [2023-12-21 04:00:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2023-12-21 04:00:49,900 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2023-12-21 04:00:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:00:49,901 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2023-12-21 04:00:49,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2023-12-21 04:00:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 04:00:49,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:00:49,902 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:00:49,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-21 04:00:50,107 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 04:00:50,107 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:00:50,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:00:50,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1243371330, now seen corresponding path program 1 times [2023-12-21 04:00:50,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:00:50,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919483020] [2023-12-21 04:00:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:50,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:00:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 04:00:50,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:00:50,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919483020] [2023-12-21 04:00:50,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919483020] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:00:50,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429508601] [2023-12-21 04:00:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:50,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:00:50,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:00:50,309 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 04:00:50,332 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 04:00:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:50,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 04:00:50,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:00:50,521 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 17 treesize of output 13 [2023-12-21 04:00:50,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 04:00:50,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2023-12-21 04:00:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 04:00:50,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:00:51,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:00:51,098 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 97 treesize of output 65 [2023-12-21 04:00:51,102 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 65 treesize of output 61 [2023-12-21 04:00:51,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:00:51,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 286 treesize of output 259 [2023-12-21 04:00:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 04:00:51,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429508601] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:00:51,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:00:51,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 11] total 28 [2023-12-21 04:00:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44648647] [2023-12-21 04:00:51,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:00:51,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 04:00:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:00:51,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 04:00:51,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2023-12-21 04:00:51,258 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:00:53,737 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-12-21 04:00:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-21 04:00:53,737 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-21 04:00:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:00:53,738 INFO L225 Difference]: With dead ends: 79 [2023-12-21 04:00:53,738 INFO L226 Difference]: Without dead ends: 71 [2023-12-21 04:00:53,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=586, Invalid=2954, Unknown=0, NotChecked=0, Total=3540 [2023-12-21 04:00:53,739 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 327 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 04:00:53,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 195 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 04:00:53,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-21 04:00:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 29. [2023-12-21 04:00:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-12-21 04:00:53,751 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2023-12-21 04:00:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:00:53,751 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-12-21 04:00:53,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2023-12-21 04:00:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 04:00:53,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:00:53,752 INFO L195 NwaCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:00:53,760 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 04:00:53,957 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 04:00:53,958 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:00:53,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:00:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1407896611, now seen corresponding path program 3 times [2023-12-21 04:00:53,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:00:53,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543197814] [2023-12-21 04:00:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:53,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:00:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 04:00:54,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:00:54,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543197814] [2023-12-21 04:00:54,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543197814] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:00:54,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960089487] [2023-12-21 04:00:54,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 04:00:54,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:00:54,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:00:54,172 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 04:00:54,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 04:00:54,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 04:00:54,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:00:54,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 04:00:54,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:00:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-21 04:00:54,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:00:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-21 04:00:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960089487] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:00:54,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:00:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 16 [2023-12-21 04:00:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967215123] [2023-12-21 04:00:54,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:00:54,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 04:00:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:00:54,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 04:00:54,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2023-12-21 04:00:54,361 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:00:54,794 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2023-12-21 04:00:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 04:00:54,794 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-21 04:00:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:00:54,795 INFO L225 Difference]: With dead ends: 61 [2023-12-21 04:00:54,795 INFO L226 Difference]: Without dead ends: 36 [2023-12-21 04:00:54,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2023-12-21 04:00:54,796 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 62 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 04:00:54,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 27 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 04:00:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-21 04:00:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2023-12-21 04:00:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2023-12-21 04:00:54,806 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2023-12-21 04:00:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:00:54,806 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2023-12-21 04:00:54,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2023-12-21 04:00:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 04:00:54,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:00:54,807 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:00:54,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 04:00:55,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:00:55,009 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:00:55,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:00:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash -40076209, now seen corresponding path program 2 times [2023-12-21 04:00:55,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:00:55,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49124048] [2023-12-21 04:00:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:55,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:00:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 04:00:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:00:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49124048] [2023-12-21 04:00:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49124048] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:00:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541370770] [2023-12-21 04:00:55,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 04:00:55,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:00:55,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:00:55,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 04:00:55,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 04:00:55,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 04:00:55,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:00:55,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-21 04:00:55,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:00:56,089 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 17 treesize of output 13 [2023-12-21 04:00:56,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 04:00:56,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:00:56,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2023-12-21 04:00:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 04:00:56,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:00:56,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:00:56,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2023-12-21 04:00:56,840 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 31 treesize of output 29 [2023-12-21 04:00:56,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1618 treesize of output 1546 [2023-12-21 04:00:56,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:00:56,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2023-12-21 04:00:56,867 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 31 treesize of output 29 [2023-12-21 04:00:56,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1618 treesize of output 1546 [2023-12-21 04:00:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 04:00:56,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541370770] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:00:56,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:00:56,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34 [2023-12-21 04:00:56,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826012871] [2023-12-21 04:00:56,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:00:57,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 04:00:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:00:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 04:00:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 04:00:57,004 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:00:58,489 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2023-12-21 04:00:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-21 04:00:58,489 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-21 04:00:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:00:58,490 INFO L225 Difference]: With dead ends: 56 [2023-12-21 04:00:58,490 INFO L226 Difference]: Without dead ends: 54 [2023-12-21 04:00:58,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=709, Invalid=2831, Unknown=0, NotChecked=0, Total=3540 [2023-12-21 04:00:58,491 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 190 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 04:00:58,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 82 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 04:00:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-21 04:00:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2023-12-21 04:00:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2023-12-21 04:00:58,507 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2023-12-21 04:00:58,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:00:58,507 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2023-12-21 04:00:58,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:00:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2023-12-21 04:00:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 04:00:58,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:00:58,509 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:00:58,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 04:00:58,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:00:58,715 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:00:58,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:00:58,715 INFO L85 PathProgramCache]: Analyzing trace with hash 95727853, now seen corresponding path program 3 times [2023-12-21 04:00:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:00:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010751055] [2023-12-21 04:00:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:00:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:00:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:00:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 04:00:59,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:00:59,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010751055] [2023-12-21 04:00:59,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010751055] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:00:59,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34950910] [2023-12-21 04:00:59,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 04:00:59,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:00:59,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:00:59,449 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 04:00:59,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 04:00:59,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 04:00:59,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:00:59,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-21 04:00:59,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:00:59,776 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 15 treesize of output 1 [2023-12-21 04:00:59,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 43 [2023-12-21 04:00:59,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2023-12-21 04:00:59,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2023-12-21 04:00:59,932 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 17 treesize of output 13 [2023-12-21 04:01:00,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 04:01:00,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:00,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2023-12-21 04:01:00,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:00,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2023-12-21 04:01:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:01:00,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:01:01,007 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 65 treesize of output 63 [2023-12-21 04:01:01,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4482 treesize of output 4410 [2023-12-21 04:01:01,037 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 65 treesize of output 63 [2023-12-21 04:01:01,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1104 treesize of output 1086 [2023-12-21 04:01:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 04:01:01,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34950910] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:01:01,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:01:01,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 14] total 43 [2023-12-21 04:01:01,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032641553] [2023-12-21 04:01:01,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:01:01,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-21 04:01:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:01:01,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-21 04:01:01,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 04:01:01,225 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:01:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:01:03,108 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2023-12-21 04:01:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-21 04:01:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-21 04:01:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:01:03,109 INFO L225 Difference]: With dead ends: 53 [2023-12-21 04:01:03,109 INFO L226 Difference]: Without dead ends: 51 [2023-12-21 04:01:03,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=868, Invalid=3688, Unknown=0, NotChecked=0, Total=4556 [2023-12-21 04:01:03,111 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 204 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 04:01:03,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 74 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 04:01:03,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-21 04:01:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2023-12-21 04:01:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:01:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-12-21 04:01:03,129 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2023-12-21 04:01:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:01:03,129 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-12-21 04:01:03,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:01:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-12-21 04:01:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 04:01:03,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:01:03,130 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:01:03,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 04:01:03,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:01:03,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:01:03,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:01:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash -24653937, now seen corresponding path program 4 times [2023-12-21 04:01:03,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:01:03,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079732376] [2023-12-21 04:01:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:01:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:01:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:01:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 04:01:04,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:01:04,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079732376] [2023-12-21 04:01:04,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079732376] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:01:04,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158199517] [2023-12-21 04:01:04,308 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 04:01:04,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:01:04,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:01:04,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 04:01:04,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 04:01:04,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 04:01:04,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:01:04,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-21 04:01:04,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:01:04,568 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 17 treesize of output 13 [2023-12-21 04:01:04,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2023-12-21 04:01:04,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:04,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2023-12-21 04:01:04,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:04,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 62 [2023-12-21 04:01:04,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 04:01:04,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 04:01:04,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 04:01:04,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 04:01:04,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:04,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 76 [2023-12-21 04:01:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 04:01:05,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:01:06,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:06,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 42 [2023-12-21 04:01:06,075 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 42 treesize of output 40 [2023-12-21 04:01:06,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6418 treesize of output 6346 [2023-12-21 04:01:06,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 04:01:06,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 42 [2023-12-21 04:01:06,141 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 42 treesize of output 40 [2023-12-21 04:01:06,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6418 treesize of output 6346 [2023-12-21 04:01:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 04:01:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158199517] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:01:06,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:01:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 15] total 51 [2023-12-21 04:01:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270441860] [2023-12-21 04:01:06,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:01:06,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-21 04:01:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:01:06,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-21 04:01:06,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2242, Unknown=0, NotChecked=0, Total=2550 [2023-12-21 04:01:06,263 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:01:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:01:08,413 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2023-12-21 04:01:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-21 04:01:08,413 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-21 04:01:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:01:08,414 INFO L225 Difference]: With dead ends: 43 [2023-12-21 04:01:08,414 INFO L226 Difference]: Without dead ends: 41 [2023-12-21 04:01:08,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1502 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=909, Invalid=5253, Unknown=0, NotChecked=0, Total=6162 [2023-12-21 04:01:08,415 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 160 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 04:01:08,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 78 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 04:01:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-21 04:01:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2023-12-21 04:01:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:01:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-12-21 04:01:08,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 30 [2023-12-21 04:01:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:01:08,435 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-12-21 04:01:08,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 51 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:01:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-12-21 04:01:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-21 04:01:08,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 04:01:08,436 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 04:01:08,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-21 04:01:08,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:01:08,638 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 04:01:08,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 04:01:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash -20867667, now seen corresponding path program 5 times [2023-12-21 04:01:08,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 04:01:08,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991009604] [2023-12-21 04:01:08,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 04:01:08,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 04:01:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 04:01:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 04:01:08,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 04:01:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991009604] [2023-12-21 04:01:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991009604] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 04:01:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347458385] [2023-12-21 04:01:08,791 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 04:01:08,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 04:01:08,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 04:01:08,792 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 04:01:08,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 04:01:09,019 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-21 04:01:09,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 04:01:09,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 04:01:09,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 04:01:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 04:01:09,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 04:01:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 04:01:09,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347458385] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 04:01:09,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 04:01:09,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-12-21 04:01:09,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843394104] [2023-12-21 04:01:09,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 04:01:09,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 04:01:09,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 04:01:09,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 04:01:09,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2023-12-21 04:01:09,273 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:01:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 04:01:09,421 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2023-12-21 04:01:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 04:01:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-21 04:01:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 04:01:09,422 INFO L225 Difference]: With dead ends: 59 [2023-12-21 04:01:09,422 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 04:01:09,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2023-12-21 04:01:09,423 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 04:01:09,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 46 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 04:01:09,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 04:01:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 04:01:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:01:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 04:01:09,423 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2023-12-21 04:01:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 04:01:09,424 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 04:01:09,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 04:01:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 04:01:09,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 04:01:09,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 04:01:09,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 04:01:09,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 04:01:09,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 04:01:10,390 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-12-21 04:01:10,390 INFO L895 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (let ((.cse10 (select |#memory_int#1| |ULTIMATE.start_main_~#str2~0#1.base|)) (.cse9 (select |#memory_int#2| |ULTIMATE.start_main_~#str1~0#1.base|))) (let ((.cse0 (= (select .cse10 1) (select .cse9 3))) (.cse1 (= 5 |ULTIMATE.start_main_~max~0#1|)) (.cse2 (= (select .cse10 0) 0)) (.cse3 (= |ULTIMATE.start_main_~#str2~0#1.offset| 0)) (.cse4 (= (select .cse10 2) (select .cse9 2))) (.cse5 (= (select .cse9 1) (select .cse10 3))) (.cse6 (= (select .cse9 4) 0)) (.cse7 (= (select .cse9 0) (select .cse10 4))) (.cse8 (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))) (or (and (= 2 |ULTIMATE.start_main_~j~0#1|) .cse0 .cse1 (= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= 3 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~j~0#1| 1) .cse8) (and (= |ULTIMATE.start_main_~j~0#1| 4) (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= 5 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3 (= 3 |ULTIMATE.start_main_~j~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 4) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~j~0#1| 0) .cse7 .cse8)))) [2023-12-21 04:01:10,390 INFO L899 garLoopResultBuilder]: For program point L32-4(lines 32 35) no Hoare annotation was computed. [2023-12-21 04:01:10,390 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2023-12-21 04:01:10,390 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 04:01:10,390 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 04:01:10,391 INFO L895 garLoopResultBuilder]: At program point L26-3(lines 26 29) the Hoare annotation is: (let ((.cse13 (select |#memory_int#2| |ULTIMATE.start_main_~#str1~0#1.base|))) (let ((.cse10 (select .cse13 2)) (.cse11 (select .cse13 3)) (.cse12 (select .cse13 1)) (.cse9 (select |#memory_int#1| |ULTIMATE.start_main_~#str2~0#1.base|))) (let ((.cse5 (= .cse12 (select .cse9 3))) (.cse0 (= (select .cse9 1) .cse11)) (.cse2 (= (select .cse9 0) 0)) (.cse4 (= (select .cse9 2) .cse10)) (.cse1 (= 5 |ULTIMATE.start_main_~max~0#1|)) (.cse3 (= |ULTIMATE.start_main_~#str2~0#1.offset| 0)) (.cse6 (= (select .cse13 4) 0)) (.cse7 (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~j~0#1| 4) (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (select .cse13 0))) (and (= .cse8 (select .cse9 (+ (- 1) |ULTIMATE.start_main_~j~0#1|))) .cse0 (= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse10 (select .cse9 (+ (- 3) |ULTIMATE.start_main_~j~0#1|))) (= .cse8 (select .cse9 4)) .cse7 (= .cse11 (select .cse9 (+ |ULTIMATE.start_main_~j~0#1| (- 4)))) (= .cse12 (select .cse9 (+ (- 2) |ULTIMATE.start_main_~j~0#1|))))) (and (= 3 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2 .cse3 .cse6 (= |ULTIMATE.start_main_~j~0#1| 1) .cse7) (and (= 2 |ULTIMATE.start_main_~j~0#1|) .cse0 .cse1 (= 2 |ULTIMATE.start_main_~i~0#1|) .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse1 (= |ULTIMATE.start_main_~i~0#1| 1) .cse2 .cse3 (= 3 |ULTIMATE.start_main_~j~0#1|) .cse4 .cse6 .cse7) (and (= |ULTIMATE.start_main_~i~0#1| 4) .cse1 .cse3 .cse6 (= |ULTIMATE.start_main_~j~0#1| 0) .cse7))))) [2023-12-21 04:01:10,391 INFO L899 garLoopResultBuilder]: For program point L26-4(lines 26 29) no Hoare annotation was computed. [2023-12-21 04:01:10,391 INFO L895 garLoopResultBuilder]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse0 (= 5 |ULTIMATE.start_main_~max~0#1|)) (.cse1 (= |ULTIMATE.start_main_~#str2~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~#str1~0#1.offset| 0))) (or (and (= 3 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1 .cse2) (and .cse0 (= |ULTIMATE.start_main_~i~0#1| 1) .cse1 .cse2) (and (= |ULTIMATE.start_main_~i~0#1| 4) .cse0 .cse1 .cse2) (and (= 5 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1 .cse2) (and .cse0 (= 2 |ULTIMATE.start_main_~i~0#1|) .cse1 .cse2) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2))) [2023-12-21 04:01:10,391 INFO L899 garLoopResultBuilder]: For program point L18-4(lines 18 20) no Hoare annotation was computed. [2023-12-21 04:01:10,391 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-12-21 04:01:10,391 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2023-12-21 04:01:10,393 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2023-12-21 04:01:10,394 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 04:01:10,419 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,420 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,420 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,420 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-21 04:01:10,420 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,420 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-21 04:01:10,420 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-21 04:01:10,420 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,420 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-21 04:01:10,420 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,421 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-21 04:01:10,422 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,423 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,424 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,424 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-21 04:01:10,424 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,424 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-21 04:01:10,424 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-21 04:01:10,424 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,424 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-21 04:01:10,424 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-21 04:01:10,426 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-1 + ~j~0] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,427 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-3 + ~j~0] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][~j~0 + -4] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-2 + ~j~0] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,428 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,429 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated [2023-12-21 04:01:10,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 04:01:10 BoogieIcfgContainer [2023-12-21 04:01:10,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 04:01:10,430 INFO L158 Benchmark]: Toolchain (without parser) took 25941.89ms. Allocated memory was 249.6MB in the beginning and 521.1MB in the end (delta: 271.6MB). Free memory was 197.1MB in the beginning and 415.6MB in the end (delta: -218.5MB). Peak memory consumption was 294.4MB. Max. memory is 8.0GB. [2023-12-21 04:01:10,430 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 04:01:10,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.89ms. Allocated memory is still 249.6MB. Free memory was 197.1MB in the beginning and 186.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 04:01:10,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.50ms. Allocated memory is still 249.6MB. Free memory was 186.1MB in the beginning and 184.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 04:01:10,431 INFO L158 Benchmark]: Boogie Preprocessor took 29.27ms. Allocated memory is still 249.6MB. Free memory was 184.5MB in the beginning and 182.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 04:01:10,431 INFO L158 Benchmark]: RCFGBuilder took 299.19ms. Allocated memory is still 249.6MB. Free memory was 182.4MB in the beginning and 168.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 04:01:10,431 INFO L158 Benchmark]: TraceAbstraction took 25392.36ms. Allocated memory was 249.6MB in the beginning and 521.1MB in the end (delta: 271.6MB). Free memory was 167.7MB in the beginning and 415.6MB in the end (delta: -247.9MB). Peak memory consumption was 265.1MB. Max. memory is 8.0GB. [2023-12-21 04:01:10,432 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.09ms. Allocated memory is still 189.8MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.89ms. Allocated memory is still 249.6MB. Free memory was 197.1MB in the beginning and 186.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.50ms. Allocated memory is still 249.6MB. Free memory was 186.1MB in the beginning and 184.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.27ms. Allocated memory is still 249.6MB. Free memory was 184.5MB in the beginning and 182.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 299.19ms. Allocated memory is still 249.6MB. Free memory was 182.4MB in the beginning and 168.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 25392.36ms. Allocated memory was 249.6MB in the beginning and 521.1MB in the end (delta: 271.6MB). Free memory was 167.7MB in the beginning and 415.6MB in the end (delta: -247.9MB). Peak memory consumption was 265.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-1 + ~j~0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-3 + ~j~0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][~j~0 + -4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][-2 + ~j~0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#str2~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#str1~0!base][4] could not be translated * 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 - PositiveResult [Line: 7]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.3s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1171 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1171 mSDsluCounter, 698 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 637 mSDsCounter, 443 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2771 IncrementalHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 443 mSolverCounterUnsat, 61 mSDtfsCounter, 2771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5204 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=9, InterpolantAutomatonStates: 217, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 164 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 21 NumberOfFragments, 856 HoareAnnotationTreeSize, 3 FormulaSimplifications, 6102972 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FormulaSimplificationsInter, 128 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 359 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 504 ConstructedInterpolants, 24 QuantifiedInterpolants, 11767 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1307 ConjunctsInSsa, 352 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 292/796 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((2 == j) && (5 == max)) && (2 == i)) || (((3 == i) && (5 == max)) && (j == 1))) || (((j == 4) && (i == 0)) && (5 == max))) || ((5 == i) && (5 == max))) || (((5 == max) && (i == 1)) && (3 == j))) || (((i == 4) && (5 == max)) && (j == 0))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((3 == i) && (5 == max)) || ((5 == max) && (i == 1))) || ((i == 4) && (5 == max))) || ((5 == i) && (5 == max))) || ((5 == max) && (2 == i))) || ((i == 0) && (5 == max))) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((((((j == 4) && (i == 0)) && (5 == max)) || (((i + 1) == 0) && (5 == max))) || (((3 == i) && (5 == max)) && (j == 1))) || (((2 == j) && (5 == max)) && (2 == i))) || (((5 == max) && (i == 1)) && (3 == j))) || (((i == 4) && (5 == max)) && (j == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-21 04:01:10,469 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...