/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/array-patterns/array11_pattern.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 09:20:08,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 09:20:08,911 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-20 09:20:08,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 09:20:08,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 09:20:08,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 09:20:08,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 09:20:08,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 09:20:08,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 09:20:08,940 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 09:20:08,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 09:20:08,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 09:20:08,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 09:20:08,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 09:20:08,942 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 09:20:08,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 09:20:08,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 09:20:08,942 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 09:20:08,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 09:20:08,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 09:20:08,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 09:20:08,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 09:20:08,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 09:20:08,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 09:20:08,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 09:20:08,944 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 09:20:08,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 09:20:08,944 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 09:20:08,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 09:20:08,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 09:20:08,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 09:20:08,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 09:20:08,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 09:20:08,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 09:20:08,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 09:20:08,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 09:20:08,946 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 09:20:08,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 09:20:08,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 09:20:08,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 09:20:08,946 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 09:20:08,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 09:20:08,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 09:20:08,947 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-20 09:20:09,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 09:20:09,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 09:20:09,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 09:20:09,129 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 09:20:09,129 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 09:20:09,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array11_pattern.c [2023-12-20 09:20:10,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 09:20:10,194 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 09:20:10,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array11_pattern.c [2023-12-20 09:20:10,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9302e96/893c4d56e017448e893a976a85c1b82b/FLAGf3ddfd785 [2023-12-20 09:20:10,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9302e96/893c4d56e017448e893a976a85c1b82b [2023-12-20 09:20:10,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 09:20:10,213 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 09:20:10,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 09:20:10,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 09:20:10,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 09:20:10,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec6ffb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10, skipping insertion in model container [2023-12-20 09:20:10,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,233 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 09:20:10,328 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array11_pattern.c[1357,1370] [2023-12-20 09:20:10,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 09:20:10,359 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 09:20:10,369 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array11_pattern.c[1357,1370] [2023-12-20 09:20:10,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 09:20:10,391 INFO L206 MainTranslator]: Completed translation [2023-12-20 09:20:10,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10 WrapperNode [2023-12-20 09:20:10,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 09:20:10,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 09:20:10,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 09:20:10,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 09:20:10,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,428 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2023-12-20 09:20:10,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 09:20:10,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 09:20:10,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 09:20:10,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 09:20:10,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,450 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2023-12-20 09:20:10,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 09:20:10,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 09:20:10,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 09:20:10,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 09:20:10,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (1/1) ... [2023-12-20 09:20:10,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 09:20:10,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 09:20:10,499 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-20 09:20:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 09:20:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 09:20:10,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 09:20:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 09:20:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 09:20:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-20 09:20:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-20 09:20:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-20 09:20:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-20 09:20:10,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-20 09:20:10,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 09:20:10,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 09:20:10,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-20 09:20:10,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-20 09:20:10,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-20 09:20:10,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-20 09:20:10,515 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-20 09:20:10,583 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 09:20:10,586 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 09:20:10,702 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 09:20:10,728 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 09:20:10,728 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-20 09:20:10,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:20:10 BoogieIcfgContainer [2023-12-20 09:20:10,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 09:20:10,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 09:20:10,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 09:20:10,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 09:20:10,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 09:20:10" (1/3) ... [2023-12-20 09:20:10,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7743fcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:20:10, skipping insertion in model container [2023-12-20 09:20:10,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 09:20:10" (2/3) ... [2023-12-20 09:20:10,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7743fcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 09:20:10, skipping insertion in model container [2023-12-20 09:20:10,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 09:20:10" (3/3) ... [2023-12-20 09:20:10,737 INFO L112 eAbstractionObserver]: Analyzing ICFG array11_pattern.c [2023-12-20 09:20:10,748 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 09:20:10,748 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 09:20:10,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 09:20:10,788 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;@30e8799f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 09:20:10,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 09:20:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 09:20:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-20 09:20:10,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 09:20:10,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 09:20:10,798 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 09:20:10,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 09:20:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash -208916493, now seen corresponding path program 1 times [2023-12-20 09:20:10,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 09:20:10,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232112551] [2023-12-20 09:20:10,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 09:20:10,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 09:20:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 09:20:10,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 09:20:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 09:20:10,951 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-20 09:20:10,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 09:20:10,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232112551] [2023-12-20 09:20:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232112551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 09:20:10,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 09:20:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 09:20:10,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738754085] [2023-12-20 09:20:10,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 09:20:10,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 09:20:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 09:20:10,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 09:20:10,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 09:20:10,982 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-20 09:20:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 09:20:11,003 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2023-12-20 09:20:11,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 09:20:11,005 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-20 09:20:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 09:20:11,009 INFO L225 Difference]: With dead ends: 38 [2023-12-20 09:20:11,009 INFO L226 Difference]: Without dead ends: 18 [2023-12-20 09:20:11,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 09:20:11,014 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 09:20:11,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 09:20:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-20 09:20:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-20 09:20:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 09:20:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-20 09:20:11,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2023-12-20 09:20:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 09:20:11,038 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-20 09:20:11,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-20 09:20:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-20 09:20:11,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-20 09:20:11,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 09:20:11,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 09:20:11,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 09:20:11,040 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 09:20:11,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 09:20:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1520585160, now seen corresponding path program 1 times [2023-12-20 09:20:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 09:20:11,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710441608] [2023-12-20 09:20:11,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 09:20:11,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 09:20:11,062 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 09:20:11,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1827331855] [2023-12-20 09:20:11,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 09:20:11,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 09:20:11,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 09:20:11,089 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-20 09:20:11,125 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-20 09:20:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 09:20:11,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 09:20:11,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 09:20:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-20 09:20:11,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 09:20:11,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 09:20:11,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710441608] [2023-12-20 09:20:11,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 09:20:11,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827331855] [2023-12-20 09:20:11,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827331855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 09:20:11,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 09:20:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 09:20:11,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410999659] [2023-12-20 09:20:11,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 09:20:11,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 09:20:11,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 09:20:11,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 09:20:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 09:20:11,250 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 09:20:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 09:20:11,269 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2023-12-20 09:20:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 09:20:11,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-12-20 09:20:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 09:20:11,270 INFO L225 Difference]: With dead ends: 23 [2023-12-20 09:20:11,270 INFO L226 Difference]: Without dead ends: 19 [2023-12-20 09:20:11,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-20 09:20:11,271 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 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-20 09:20:11,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 09:20:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-20 09:20:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-20 09:20:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 09:20:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-20 09:20:11,276 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 21 [2023-12-20 09:20:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 09:20:11,277 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-20 09:20:11,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 09:20:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-20 09:20:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-20 09:20:11,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 09:20:11,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 09:20:11,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 09:20:11,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 09:20:11,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 09:20:11,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 09:20:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash 133041195, now seen corresponding path program 1 times [2023-12-20 09:20:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 09:20:11,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372871979] [2023-12-20 09:20:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 09:20:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 09:20:11,527 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 09:20:11,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244736721] [2023-12-20 09:20:11,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 09:20:11,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 09:20:11,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 09:20:11,535 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-20 09:20:11,538 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-20 09:20:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 09:20:11,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-20 09:20:11,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 09:20:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 09:20:11,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 09:20:11,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 09:20:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372871979] [2023-12-20 09:20:11,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 09:20:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244736721] [2023-12-20 09:20:11,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244736721] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 09:20:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 09:20:11,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 09:20:11,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180697828] [2023-12-20 09:20:11,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 09:20:11,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 09:20:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 09:20:11,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 09:20:11,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 09:20:11,653 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 09:20:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 09:20:11,849 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-12-20 09:20:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 09:20:11,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-12-20 09:20:11,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 09:20:11,851 INFO L225 Difference]: With dead ends: 35 [2023-12-20 09:20:11,851 INFO L226 Difference]: Without dead ends: 20 [2023-12-20 09:20:11,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 09:20:11,859 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 09:20:11,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 09:20:11,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-20 09:20:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-20 09:20:11,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 09:20:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-12-20 09:20:11,863 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 22 [2023-12-20 09:20:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 09:20:11,863 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-12-20 09:20:11,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-20 09:20:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-12-20 09:20:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-20 09:20:11,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 09:20:11,864 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 09:20:11,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 09:20:12,072 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,SelfDestructingSolverStorable2 [2023-12-20 09:20:12,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 09:20:12,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 09:20:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1617342797, now seen corresponding path program 1 times [2023-12-20 09:20:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 09:20:12,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954595023] [2023-12-20 09:20:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 09:20:12,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 09:20:12,105 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-20 09:20:12,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081582399] [2023-12-20 09:20:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 09:20:12,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 09:20:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 09:20:12,106 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-20 09:20:12,137 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-20 09:20:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 09:20:12,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-20 09:20:12,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 09:20:12,277 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 11 treesize of output 7 [2023-12-20 09:20:12,289 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 11 treesize of output 7 [2023-12-20 09:20:12,560 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-20 09:20:12,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-20 09:20:12,576 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-20 09:20:12,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2023-12-20 09:20:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-20 09:20:12,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 09:20:21,654 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 09:20:38,205 WARN L293 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 09:21:38,554 WARN L293 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 09:21:51,835 WARN L293 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 09:24:07,561 WARN L293 SmtUtils]: Spent 2.05m on a formula simplification. DAG size of input: 126 DAG size of output: 89 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 09:24:43,868 WARN L293 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 09:25:17,599 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 09:27:13,519 WARN L293 SmtUtils]: Spent 1.80m on a formula simplification that was a NOOP. DAG size: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 09:28:59,671 WARN L293 SmtUtils]: Spent 33.50s on a formula simplification. DAG size of input: 184 DAG size of output: 164 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 09:29:58,916 WARN L293 SmtUtils]: Spent 18.22s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 09:29:59,045 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 118 treesize of output 114 [2023-12-20 09:29:59,072 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 114 treesize of output 110 [2023-12-20 09:29:59,098 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 675 treesize of output 667 [2023-12-20 09:29:59,141 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 223 treesize of output 219 [2023-12-20 09:30:21,855 WARN L293 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 09:30:26,776 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 140 treesize of output 136 [2023-12-20 09:30:26,789 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 136 treesize of output 132 [2023-12-20 09:30:26,803 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 807 treesize of output 799 [2023-12-20 09:30:26,823 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 450 treesize of output 442 [2023-12-20 09:30:27,226 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 114 treesize of output 110 [2023-12-20 09:30:27,274 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 110 treesize of output 106 [2023-12-20 09:30:27,349 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 337 treesize of output 333 [2023-12-20 09:30:27,378 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 461 treesize of output 453 [2023-12-20 09:31:05,379 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 110 treesize of output 106 [2023-12-20 09:31:05,397 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 106 treesize of output 102 [2023-12-20 09:31:05,415 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 639 treesize of output 631 [2023-12-20 09:31:05,440 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 378 treesize of output 370 [2023-12-20 09:31:09,971 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 114 treesize of output 110 [2023-12-20 09:31:10,194 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 110 treesize of output 106 [2023-12-20 09:31:12,149 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 667 treesize of output 659 [2023-12-20 09:31:12,401 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 408 treesize of output 400 [2023-12-20 09:31:50,415 WARN L293 SmtUtils]: Spent 28.73s on a formula simplification. DAG size of input: 114 DAG size of output: 112 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 09:31:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-20 09:31:50,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 09:31:50,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954595023] [2023-12-20 09:31:50,547 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-20 09:31:50,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081582399] [2023-12-20 09:31:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081582399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 09:31:50,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 09:31:50,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2023-12-20 09:31:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253127524] [2023-12-20 09:31:50,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 09:31:50,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-20 09:31:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 09:31:50,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-20 09:31:50,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=552, Unknown=12, NotChecked=0, Total=702 [2023-12-20 09:31:50,549 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 27 states, 25 states have (on average 1.4) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-20 09:31:53,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:31:55,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:31:57,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 09:32:00,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:32:04,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:32:11,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:32:14,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:32:15,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:32:20,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse48 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse49 (* .cse48 4))) (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse51 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse49)) (.cse50 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse38 (= (+ |c_ULTIMATE.start_main_~index~0#1| 1) c_~ARR_SIZE~0)) (.cse33 (< .cse50 2147483648)) (.cse31 (select (store .cse4 .cse51 (+ .cse50 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse0 (* c_~ARR_SIZE~0 2)) (.cse34 (select (store .cse4 .cse51 .cse50) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse35 (< 2147483647 .cse50)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse36 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse49))) (let ((.cse30 (or (not .cse38) (let ((.cse47 (select (store .cse3 .cse36 .cse48) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or .cse33 (= .cse0 (+ .cse31 .cse47 |c_ULTIMATE.start_main_~sum~0#1| 2)) (= (+ .cse31 .cse47 |c_ULTIMATE.start_main_~sum~0#1|) 0)) (or (= .cse0 (+ .cse47 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse34)) (= (+ .cse47 |c_ULTIMATE.start_main_~sum~0#1| .cse34) 0) .cse35))))) (.cse37 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse2)) (= (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| .cse2) 0))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse8 (* v_y_6 4294967296)) (.cse7 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse11 (* v_z_6 4)) (.cse10 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse5 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse11) (+ .cse10 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse6 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse11) (+ .cse7 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse9 (+ .cse8 v_z_6))) (or (< 4294967295 v_z_6) (= .cse0 (+ .cse5 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse6)) (< .cse7 2147483648) (< c_~ARR_SIZE~0 (+ .cse8 v_z_6 1)) (= 0 (+ .cse5 |c_ULTIMATE.start_main_~sum~0#1| .cse6)) (< .cse9 0) (< v_z_6 0) (< 32767 .cse9) (< .cse10 2147483648))))) (or (= |c_ULTIMATE.start_main_~sum~0#1| 0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2))) (forall ((v_z_2 Int) (v_y_2 Int)) (let ((.cse17 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse18 (* v_z_2 4)) (.cse16 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse12 (* v_y_2 4294967296))) (let ((.cse15 (+ .cse12 v_z_2)) (.cse13 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse18) .cse16) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse14 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse18) (+ .cse17 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (< c_~ARR_SIZE~0 (+ .cse12 v_z_2 1)) (< 4294967295 v_z_2) (= .cse0 (+ .cse13 .cse14 |c_ULTIMATE.start_main_~sum~0#1| 2)) (< .cse15 0) (< 32767 .cse15) (< 2147483647 .cse16) (< .cse17 2147483648) (= (+ .cse13 .cse14 |c_ULTIMATE.start_main_~sum~0#1|) 0) (< v_z_2 0))))) (let ((.cse22 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse21 (* .cse22 4))) (let ((.cse19 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse21) (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* c_~ARR_SIZE~0 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse20 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse21) .cse22) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (< 32768 c_~ARR_SIZE~0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse19 .cse20)) (< c_~ARR_SIZE~0 1) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse19 .cse20) 0))))) (<= 1 c_~ARR_SIZE~0) (forall ((v_z_7 Int) (v_y_7 Int)) (let ((.cse25 (* v_y_7 4294967296)) (.cse28 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse29 (* v_z_7 4)) (.cse23 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse26 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse29) (+ .cse23 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse27 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse29) .cse28) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse24 (+ .cse25 v_z_7))) (or (< .cse23 2147483648) (< 32767 .cse24) (< v_z_7 0) (< c_~ARR_SIZE~0 (+ .cse25 v_z_7 1)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse26 .cse27) 0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse26 .cse27)) (< 2147483647 .cse28) (< 4294967295 v_z_7) (< .cse24 0))))) (or (and .cse30 (or (let ((.cse32 (select (store .cse3 .cse36 .cse37) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= (+ .cse31 |c_ULTIMATE.start_main_~sum~0#1| .cse32) 0) .cse33 (= (+ .cse31 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse32) .cse0)) (or (= 0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse32 .cse34)) .cse35 (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse32 .cse34))))) .cse38)) (< 2147483647 .cse37)) (or (< .cse37 2147483648) (and .cse30 (or (let ((.cse39 (select (store .cse3 .cse36 (+ .cse37 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= .cse0 (+ .cse39 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse34)) .cse35 (= (+ .cse39 |c_ULTIMATE.start_main_~sum~0#1| .cse34) 0)) (or (= (+ .cse31 .cse39 |c_ULTIMATE.start_main_~sum~0#1|) 0) (= .cse0 (+ .cse31 .cse39 |c_ULTIMATE.start_main_~sum~0#1| 2)) .cse33))) .cse38))) (forall ((v_z_3 Int) (v_y_3 Int)) (let ((.cse45 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse46 (* v_z_3 4)) (.cse42 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse43 (* v_y_3 4294967296))) (let ((.cse44 (+ v_z_3 .cse43)) (.cse40 (select (store .cse4 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse46) .cse42) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse41 (select (store .cse3 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse46) .cse45) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ .cse40 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse41)) (< 2147483647 .cse42) (< 4294967295 v_z_3) (< c_~ARR_SIZE~0 (+ v_z_3 .cse43 1)) (< .cse44 0) (< 32767 .cse44) (< v_z_3 0) (< 2147483647 .cse45) (= (+ .cse40 |c_ULTIMATE.start_main_~sum~0#1| .cse41) 0))))))))))) is different from false [2023-12-20 09:32:25,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:32:30,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:32:34,669 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~ARR_SIZE~0 2)) (.cse7 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse9 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse4 (* v_y_6 4294967296)) (.cse3 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse8 (* v_z_6 4)) (.cse6 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse1 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8) (+ .cse6 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse2 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8) (+ .cse3 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse5 (+ .cse4 v_z_6))) (or (< 4294967295 v_z_6) (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse2)) (< .cse3 2147483648) (< c_~ARR_SIZE~0 (+ .cse4 v_z_6 1)) (= 0 (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| .cse2)) (< .cse5 0) (< v_z_6 0) (< 32767 .cse5) (< .cse6 2147483648))))) (forall ((v_z_2 Int) (v_y_2 Int)) (let ((.cse15 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse16 (* v_z_2 4)) (.cse14 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse10 (* v_y_2 4294967296))) (let ((.cse13 (+ .cse10 v_z_2)) (.cse11 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16) .cse14) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse12 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16) (+ .cse15 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (< c_~ARR_SIZE~0 (+ .cse10 v_z_2 1)) (< 4294967295 v_z_2) (= .cse0 (+ .cse11 .cse12 |c_ULTIMATE.start_main_~sum~0#1| 2)) (< .cse13 0) (< 32767 .cse13) (< 2147483647 .cse14) (< .cse15 2147483648) (= (+ .cse11 .cse12 |c_ULTIMATE.start_main_~sum~0#1|) 0) (< v_z_2 0))))) (let ((.cse20 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse19 (* .cse20 4))) (let ((.cse17 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19) (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* c_~ARR_SIZE~0 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse18 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19) .cse20) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (< 32768 c_~ARR_SIZE~0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse17 .cse18)) (< c_~ARR_SIZE~0 1) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse17 .cse18) 0))))) (let ((.cse21 (+ |c_ULTIMATE.start_main_~index~0#1| 1))) (or (< |c_ULTIMATE.start_main_~index~0#1| 0) (< c_~ARR_SIZE~0 .cse21) (let ((.cse33 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse34 (* .cse33 4))) (let ((.cse36 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse34)) (.cse35 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse30 (= .cse21 c_~ARR_SIZE~0)) (.cse25 (< .cse35 2147483648)) (.cse23 (select (store .cse9 .cse36 (+ .cse35 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse26 (select (store .cse9 .cse36 .cse35) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse27 (< 2147483647 .cse35)) (.cse28 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse34))) (let ((.cse22 (or (not .cse30) (let ((.cse32 (select (store .cse7 .cse28 .cse33) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or .cse25 (= .cse0 (+ .cse23 .cse32 |c_ULTIMATE.start_main_~sum~0#1| 2)) (= (+ .cse23 .cse32 |c_ULTIMATE.start_main_~sum~0#1|) 0)) (or (= .cse0 (+ .cse32 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse26)) (= (+ .cse32 |c_ULTIMATE.start_main_~sum~0#1| .cse26) 0) .cse27))))) (.cse29 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (or (and .cse22 (or (let ((.cse24 (select (store .cse7 .cse28 .cse29) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= (+ .cse23 |c_ULTIMATE.start_main_~sum~0#1| .cse24) 0) .cse25 (= (+ .cse23 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse24) .cse0)) (or (= 0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse24 .cse26)) .cse27 (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse24 .cse26))))) .cse30)) (< 2147483647 .cse29)) (or (< .cse29 2147483648) (and .cse22 (or (let ((.cse31 (select (store .cse7 .cse28 (+ .cse29 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= .cse0 (+ .cse31 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse26)) .cse27 (= (+ .cse31 |c_ULTIMATE.start_main_~sum~0#1| .cse26) 0)) (or (= (+ .cse23 .cse31 |c_ULTIMATE.start_main_~sum~0#1|) 0) (= .cse0 (+ .cse23 .cse31 |c_ULTIMATE.start_main_~sum~0#1| 2)) .cse25))) .cse30))))))))))) (forall ((v_z_7 Int) (v_y_7 Int)) (let ((.cse39 (* v_y_7 4294967296)) (.cse42 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse43 (* v_z_7 4)) (.cse37 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse40 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse43) (+ .cse37 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse41 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse43) .cse42) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse38 (+ .cse39 v_z_7))) (or (< .cse37 2147483648) (< 32767 .cse38) (< v_z_7 0) (< c_~ARR_SIZE~0 (+ .cse39 v_z_7 1)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse40 .cse41) 0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse40 .cse41)) (< 2147483647 .cse42) (< 4294967295 v_z_7) (< .cse38 0))))) (forall ((v_z_3 Int) (v_y_3 Int)) (let ((.cse49 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse50 (* v_z_3 4)) (.cse46 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse47 (* v_y_3 4294967296))) (let ((.cse48 (+ v_z_3 .cse47)) (.cse44 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse50) .cse46) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse45 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse50) .cse49) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ .cse44 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse45)) (< 2147483647 .cse46) (< 4294967295 v_z_3) (< c_~ARR_SIZE~0 (+ v_z_3 .cse47 1)) (< .cse48 0) (< 32767 .cse48) (< v_z_3 0) (< 2147483647 .cse49) (= (+ .cse44 |c_ULTIMATE.start_main_~sum~0#1| .cse45) 0))))))) is different from false [2023-12-20 09:32:38,677 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~ARR_SIZE~0 2)) (.cse7 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse9 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse4 (* v_y_6 4294967296)) (.cse3 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse8 (* v_z_6 4)) (.cse6 (mod (* v_z_6 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse1 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse8) (+ .cse6 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse2 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse8) (+ .cse3 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse5 (+ .cse4 v_z_6))) (or (< 4294967295 v_z_6) (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse2)) (< .cse3 2147483648) (< c_~ARR_SIZE~0 (+ .cse4 v_z_6 1)) (= 0 (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| .cse2)) (< .cse5 0) (< v_z_6 0) (< 32767 .cse5) (< .cse6 2147483648))))) (forall ((v_z_2 Int) (v_y_2 Int)) (let ((.cse15 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse16 (* v_z_2 4)) (.cse14 (mod (* v_z_2 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse10 (* v_y_2 4294967296))) (let ((.cse13 (+ .cse10 v_z_2)) (.cse11 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse16) .cse14) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse12 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse16) (+ .cse15 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (< c_~ARR_SIZE~0 (+ .cse10 v_z_2 1)) (< 4294967295 v_z_2) (= .cse0 (+ .cse11 .cse12 |c_ULTIMATE.start_main_~sum~0#1| 2)) (< .cse13 0) (< 32767 .cse13) (< 2147483647 .cse14) (< .cse15 2147483648) (= (+ .cse11 .cse12 |c_ULTIMATE.start_main_~sum~0#1|) 0) (< v_z_2 0))))) (let ((.cse20 (mod (+ c_~ARR_SIZE~0 4294967295) 4294967296))) (let ((.cse19 (* .cse20 4))) (let ((.cse17 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse19) (mod (+ (* 4294967295 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* c_~ARR_SIZE~0 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse18 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse19) .cse20) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (< 32768 c_~ARR_SIZE~0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse17 .cse18)) (< c_~ARR_SIZE~0 1) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse17 .cse18) 0))))) (let ((.cse21 (+ |c_ULTIMATE.start_main_~index~0#1| 1))) (or (< |c_ULTIMATE.start_main_~index~0#1| 0) (< c_~ARR_SIZE~0 .cse21) (let ((.cse33 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse34 (* .cse33 4))) (let ((.cse36 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse34)) (.cse35 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse30 (= .cse21 c_~ARR_SIZE~0)) (.cse25 (< .cse35 2147483648)) (.cse23 (select (store .cse9 .cse36 (+ .cse35 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse26 (select (store .cse9 .cse36 .cse35) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse27 (< 2147483647 .cse35)) (.cse28 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse34))) (let ((.cse22 (or (not .cse30) (let ((.cse32 (select (store .cse7 .cse28 .cse33) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or .cse25 (= .cse0 (+ .cse23 .cse32 |c_ULTIMATE.start_main_~sum~0#1| 2)) (= (+ .cse23 .cse32 |c_ULTIMATE.start_main_~sum~0#1|) 0)) (or (= .cse0 (+ .cse32 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse26)) (= (+ .cse32 |c_ULTIMATE.start_main_~sum~0#1| .cse26) 0) .cse27))))) (.cse29 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (or (and .cse22 (or (let ((.cse24 (select (store .cse7 .cse28 .cse29) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= (+ .cse23 |c_ULTIMATE.start_main_~sum~0#1| .cse24) 0) .cse25 (= (+ .cse23 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse24) .cse0)) (or (= 0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse24 .cse26)) .cse27 (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse24 .cse26))))) .cse30)) (< 2147483647 .cse29)) (or (< .cse29 2147483648) (and .cse22 (or (let ((.cse31 (select (store .cse7 .cse28 (+ .cse29 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= .cse0 (+ .cse31 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse26)) .cse27 (= (+ .cse31 |c_ULTIMATE.start_main_~sum~0#1| .cse26) 0)) (or (= (+ .cse23 .cse31 |c_ULTIMATE.start_main_~sum~0#1|) 0) (= .cse0 (+ .cse23 .cse31 |c_ULTIMATE.start_main_~sum~0#1| 2)) .cse25))) .cse30))))))))))) (forall ((v_z_7 Int) (v_y_7 Int)) (let ((.cse39 (* v_y_7 4294967296)) (.cse42 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse43 (* v_z_7 4)) (.cse37 (mod (* v_z_7 |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse40 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse43) (+ .cse37 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse41 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse43) .cse42) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse38 (+ .cse39 v_z_7))) (or (< .cse37 2147483648) (< 32767 .cse38) (< v_z_7 0) (< c_~ARR_SIZE~0 (+ .cse39 v_z_7 1)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse40 .cse41) 0) (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse40 .cse41)) (< 2147483647 .cse42) (< 4294967295 v_z_7) (< .cse38 0))))) (forall ((v_z_3 Int) (v_y_3 Int)) (let ((.cse49 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse50 (* v_z_3 4)) (.cse46 (mod (* v_z_3 |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse47 (* v_y_3 4294967296))) (let ((.cse48 (+ v_z_3 .cse47)) (.cse44 (select (store .cse9 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse50) .cse46) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse45 (select (store .cse7 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse50) .cse49) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ .cse44 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse45)) (< 2147483647 .cse46) (< 4294967295 v_z_3) (< c_~ARR_SIZE~0 (+ v_z_3 .cse47 1)) (< .cse48 0) (< 32767 .cse48) (< v_z_3 0) (< 2147483647 .cse49) (= (+ .cse44 |c_ULTIMATE.start_main_~sum~0#1| .cse45) 0))))))) is different from true [2023-12-20 09:32:47,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-12-20 09:32:53,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:32:55,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:33:16,473 WARN L293 SmtUtils]: Spent 14.78s on a formula simplification. DAG size of input: 114 DAG size of output: 112 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 09:33:20,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:33:22,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:33:26,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:33:30,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 09:33:35,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:33:39,411 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse17 (* .cse16 4))) (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse19 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse17)) (.cse18 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (let ((.cse13 (= (+ |c_ULTIMATE.start_main_~index~0#1| 1) c_~ARR_SIZE~0)) (.cse8 (< .cse18 2147483648)) (.cse6 (select (store .cse4 .cse19 (+ .cse18 (- 4294967296))) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse0 (* c_~ARR_SIZE~0 2)) (.cse9 (select (store .cse4 .cse19 .cse18) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse10 (< 2147483647 .cse18)) (.cse3 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse17))) (let ((.cse5 (or (not .cse13) (let ((.cse15 (select (store .cse3 .cse11 .cse16) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or .cse8 (= .cse0 (+ .cse6 .cse15 |c_ULTIMATE.start_main_~sum~0#1| 2)) (= (+ .cse6 .cse15 |c_ULTIMATE.start_main_~sum~0#1|) 0)) (or (= .cse0 (+ .cse15 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse9)) (= (+ .cse15 |c_ULTIMATE.start_main_~sum~0#1| .cse9) 0) .cse10))))) (.cse12 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (let ((.cse1 (select .cse4 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse2)) (= (+ .cse1 |c_ULTIMATE.start_main_~sum~0#1| .cse2) 0))) (or (and .cse5 (or (let ((.cse7 (select (store .cse3 .cse11 .cse12) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= (+ .cse6 |c_ULTIMATE.start_main_~sum~0#1| .cse7) 0) .cse8 (= (+ .cse6 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse7) .cse0)) (or (= 0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse7 .cse9)) .cse10 (= .cse0 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse7 .cse9))))) .cse13)) (< 2147483647 .cse12)) (or (< .cse12 2147483648) (and .cse5 (or (let ((.cse14 (select (store .cse3 .cse11 (+ .cse12 (- 4294967296))) |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (and (or (= .cse0 (+ .cse14 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse9)) .cse10 (= (+ .cse14 |c_ULTIMATE.start_main_~sum~0#1| .cse9) 0)) (or (= (+ .cse6 .cse14 |c_ULTIMATE.start_main_~sum~0#1|) 0) (= .cse0 (+ .cse6 .cse14 |c_ULTIMATE.start_main_~sum~0#1| 2)) .cse8))) .cse13))))))))) is different from false [2023-12-20 09:33:42,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:34:02,238 WARN L293 SmtUtils]: Spent 14.97s on a formula simplification. DAG size of input: 169 DAG size of output: 168 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 09:34:06,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-12-20 09:34:10,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:34:14,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-12-20 09:34:21,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] Received shutdown request... [2023-12-20 09:34:52,435 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 09:34:52,435 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-20 09:34:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-20 09:34:52,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 481.6s TimeCoverageRelationStatistics Valid=376, Invalid=1340, Unknown=18, NotChecked=246, Total=1980 [2023-12-20 09:34:52,865 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 25 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 74.3s IncrementalHoareTripleChecker+Time [2023-12-20 09:34:52,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 186 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 302 Invalid, 7 Unknown, 153 Unchecked, 74.3s Time] [2023-12-20 09:34:52,867 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 09:34:52,872 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-20 09:34:53,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 09:34:53,072 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (20states) and FLOYD_HOARE automaton (currently 31 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-2-2-7-3-2-1 term,while SimplifyDDA2 was simplifying 7 xjuncts wrt. a ∨-3-1 context. [2023-12-20 09:34:53,076 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-20 09:34:53,077 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 09:34:53,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 09:34:53 BoogieIcfgContainer [2023-12-20 09:34:53,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 09:34:53,079 INFO L158 Benchmark]: Toolchain (without parser) took 882866.36ms. Allocated memory was 189.8MB in the beginning and 242.2MB in the end (delta: 52.4MB). Free memory was 154.1MB in the beginning and 99.5MB in the end (delta: 54.6MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2023-12-20 09:34:53,079 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 189.8MB. Free memory was 145.5MB in the beginning and 145.4MB in the end (delta: 71.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 09:34:53,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.99ms. Allocated memory is still 189.8MB. Free memory was 153.7MB in the beginning and 142.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-20 09:34:53,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.04ms. Allocated memory is still 189.8MB. Free memory was 142.2MB in the beginning and 140.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 09:34:53,079 INFO L158 Benchmark]: Boogie Preprocessor took 42.23ms. Allocated memory is still 189.8MB. Free memory was 140.5MB in the beginning and 138.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 09:34:53,080 INFO L158 Benchmark]: RCFGBuilder took 255.65ms. Allocated memory is still 189.8MB. Free memory was 138.4MB in the beginning and 125.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 09:34:53,084 INFO L158 Benchmark]: TraceAbstraction took 882348.92ms. Allocated memory was 189.8MB in the beginning and 242.2MB in the end (delta: 52.4MB). Free memory was 124.4MB in the beginning and 99.5MB in the end (delta: 24.9MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. [2023-12-20 09:34:53,085 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.08ms. Allocated memory is still 189.8MB. Free memory was 145.5MB in the beginning and 145.4MB in the end (delta: 71.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.99ms. Allocated memory is still 189.8MB. Free memory was 153.7MB in the beginning and 142.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.04ms. Allocated memory is still 189.8MB. Free memory was 142.2MB in the beginning and 140.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.23ms. Allocated memory is still 189.8MB. Free memory was 140.5MB in the beginning and 138.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 255.65ms. Allocated memory is still 189.8MB. Free memory was 138.4MB in the beginning and 125.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 882348.92ms. Allocated memory was 189.8MB in the beginning and 242.2MB in the end (delta: 52.4MB). Free memory was 124.4MB in the beginning and 99.5MB in the end (delta: 24.9MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 33). Cancelled while NwaCegarLoop was constructing difference of abstraction (20states) and FLOYD_HOARE automaton (currently 31 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-2-2-7-3-2-1 term,while SimplifyDDA2 was simplifying 7 xjuncts wrt. a ∨-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 882.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 182.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 74.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 74.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 153 IncrementalHoareTripleChecker+Unchecked, 231 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 67 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 481.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 698.5s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 98 ConstructedInterpolants, 11 QuantifiedInterpolants, 4061 SizeOfPredicates, 21 NumberOfNonLiveVariables, 303 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 17/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown