./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:24:31,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:24:31,371 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-06 22:24:31,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:24:31,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:24:31,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:24:31,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:24:31,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:24:31,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:24:31,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:24:31,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:24:31,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:24:31,438 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:24:31,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:24:31,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:24:31,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:24:31,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:24:31,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:24:31,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:24:31,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:24:31,443 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:24:31,445 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:24:31,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:24:31,446 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:24:31,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:24:31,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:24:31,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:24:31,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:31,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:24:31,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:24:31,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:24:31,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:24:31,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:24:31,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:24:31,452 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:24:31,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:24:31,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:24:31,452 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:24:31,453 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b [2023-11-06 22:24:31,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:24:31,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:24:31,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:24:31,826 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:24:31,827 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:24:31,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2023-11-06 22:24:34,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:24:35,197 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:24:35,197 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2023-11-06 22:24:35,209 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/data/caa232c33/24db556b21dc47b5b73a7f89d45e7e01/FLAG88b76a540 [2023-11-06 22:24:35,223 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/data/caa232c33/24db556b21dc47b5b73a7f89d45e7e01 [2023-11-06 22:24:35,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:24:35,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:24:35,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:35,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:24:35,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:24:35,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4537d0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35, skipping insertion in model container [2023-11-06 22:24:35,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,280 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:24:35,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:35,619 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:24:35,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:35,706 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:24:35,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35 WrapperNode [2023-11-06 22:24:35,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:35,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:35,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:24:35,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:24:35,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,753 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2023-11-06 22:24:35,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:35,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:24:35,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:24:35,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:24:35,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,768 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,774 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:24:35,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:24:35,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:24:35,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:24:35,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (1/1) ... [2023-11-06 22:24:35,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:35,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:35,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:24:35,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:24:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:24:35,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:24:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:24:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:24:35,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:24:35,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:24:35,964 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:24:35,966 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:24:36,159 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:24:36,164 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:24:36,165 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:24:36,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:36 BoogieIcfgContainer [2023-11-06 22:24:36,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:24:36,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:24:36,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:24:36,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:24:36,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:35" (1/3) ... [2023-11-06 22:24:36,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f432ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:36, skipping insertion in model container [2023-11-06 22:24:36,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35" (2/3) ... [2023-11-06 22:24:36,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f432ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:36, skipping insertion in model container [2023-11-06 22:24:36,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:36" (3/3) ... [2023-11-06 22:24:36,177 INFO L112 eAbstractionObserver]: Analyzing ICFG b.09-no-inv_assume-alloca.i [2023-11-06 22:24:36,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:24:36,197 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-06 22:24:36,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:24:36,321 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=LoopsAndPotentialCycles, 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;@68cebcd6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:24:36,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 22:24:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:24:36,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:36,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:36,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:36,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash 123263665, now seen corresponding path program 1 times [2023-11-06 22:24:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809945638] [2023-11-06 22:24:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:36,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:36,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809945638] [2023-11-06 22:24:36,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809945638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:36,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:36,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256169278] [2023-11-06 22:24:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:36,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:36,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:36,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:36,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:36,708 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:36,740 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-11-06 22:24:36,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:36,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 22:24:36,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:36,750 INFO L225 Difference]: With dead ends: 39 [2023-11-06 22:24:36,751 INFO L226 Difference]: Without dead ends: 16 [2023-11-06 22:24:36,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:36,757 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:36,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-06 22:24:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-06 22:24:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2023-11-06 22:24:36,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2023-11-06 22:24:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:36,790 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2023-11-06 22:24:36,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2023-11-06 22:24:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:24:36,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:36,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:36,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:24:36,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:36,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash 180521967, now seen corresponding path program 1 times [2023-11-06 22:24:36,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:36,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837862044] [2023-11-06 22:24:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:37,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:37,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837862044] [2023-11-06 22:24:37,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837862044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:37,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:37,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:37,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408602747] [2023-11-06 22:24:37,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:37,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:37,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:37,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:37,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:37,130 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:37,205 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2023-11-06 22:24:37,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:37,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 22:24:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:37,209 INFO L225 Difference]: With dead ends: 23 [2023-11-06 22:24:37,209 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 22:24:37,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:37,216 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:37,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 23 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 22:24:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2023-11-06 22:24:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-11-06 22:24:37,228 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2023-11-06 22:24:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:37,230 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-11-06 22:24:37,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-11-06 22:24:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:24:37,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:37,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:37,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:24:37,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:37,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1301211949, now seen corresponding path program 1 times [2023-11-06 22:24:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:37,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950270112] [2023-11-06 22:24:37,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:37,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950270112] [2023-11-06 22:24:37,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950270112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:37,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:37,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:24:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473534854] [2023-11-06 22:24:37,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:37,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:37,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:37,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:37,776 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:37,877 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2023-11-06 22:24:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:24:37,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:24:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:37,880 INFO L225 Difference]: With dead ends: 27 [2023-11-06 22:24:37,880 INFO L226 Difference]: Without dead ends: 25 [2023-11-06 22:24:37,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:37,888 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:37,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 34 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:24:37,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-06 22:24:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-11-06 22:24:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-06 22:24:37,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2023-11-06 22:24:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:37,903 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-06 22:24:37,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-06 22:24:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:24:37,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:37,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:37,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:24:37,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:37,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1301213743, now seen corresponding path program 1 times [2023-11-06 22:24:37,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:37,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037887125] [2023-11-06 22:24:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:37,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:38,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:38,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:38,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037887125] [2023-11-06 22:24:38,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037887125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:38,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:38,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:38,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41145421] [2023-11-06 22:24:38,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:38,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:38,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:38,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:38,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:38,174 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:38,238 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2023-11-06 22:24:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:38,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 22:24:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:38,240 INFO L225 Difference]: With dead ends: 24 [2023-11-06 22:24:38,241 INFO L226 Difference]: Without dead ends: 23 [2023-11-06 22:24:38,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:38,249 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:38,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-06 22:24:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-06 22:24:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-06 22:24:38,263 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 9 [2023-11-06 22:24:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:38,264 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-06 22:24:38,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-11-06 22:24:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:24:38,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:38,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:38,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:24:38,266 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:38,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:38,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1319823166, now seen corresponding path program 1 times [2023-11-06 22:24:38,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405763474] [2023-11-06 22:24:38,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:38,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:38,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405763474] [2023-11-06 22:24:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405763474] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996278673] [2023-11-06 22:24:38,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:38,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:38,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:38,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:38,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:24:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:38,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:24:38,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:38,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:24:39,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:39,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-06 22:24:39,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 1 [2023-11-06 22:24:39,116 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 22:24:39,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:24:39,164 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:39,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-06 22:24:39,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 22:24:39,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:24:39,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 22:24:39,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:24:39,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 22:24:39,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-06 22:24:39,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-06 22:24:39,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:24:39,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:24:39,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:39,317 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-06 22:24:39,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 22:24:39,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 1 [2023-11-06 22:24:39,395 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:24:39,406 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:39,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-06 22:24:39,422 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:24:39,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:24:40,109 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select .cse5 0)) (.cse10 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (not .cse7)) (.cse8 (not .cse10)) (.cse2 (<= .cse4 0))) (or (and (not .cse0) (or (and .cse1 .cse2) (and (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (= (store (select (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_9))) (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| |ULTIMATE.start_test_fun_~y#1|))) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse4) .cse5)) .cse2)) (not .cse6)) (and (or (and .cse7 .cse2 (let ((.cse9 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_11) (= .cse5 (store .cse12 0 .cse4)) (= v_DerPreprocessor_12 .cse12))))))) (or (and .cse8 .cse9) (and .cse10 .cse9)))) (and (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_17))) (and (= (store (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse4) .cse5) (= (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_15)))) .cse1 .cse2)) .cse0) (and .cse6 (or (and .cse1 (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_7))) (and (= (store (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse4) .cse5) (= v_DerPreprocessor_5 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) .cse2) (and .cse7 (let ((.cse15 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_3))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= v_DerPreprocessor_2 .cse16) (= v_DerPreprocessor_1 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store .cse16 0 .cse4) .cse5))))))) (or (and .cse8 .cse15) (and .cse10 .cse15))) .cse2))))))) (or |c_ULTIMATE.start_test_fun_#t~short7#1| (< 0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) is different from true [2023-11-06 22:24:41,536 INFO L322 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-06 22:24:41,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1054 treesize of output 937 [2023-11-06 22:24:41,602 INFO L322 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-06 22:24:41,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 266 [2023-11-06 22:24:41,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 228 [2023-11-06 22:24:41,843 INFO L351 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 9 treesize of output 7 [2023-11-06 22:24:41,881 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2023-11-06 22:24:41,908 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 22:24:41,909 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 27 [2023-11-06 22:24:41,964 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-11-06 22:24:41,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 79 [2023-11-06 22:24:42,001 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:24:42,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2023-11-06 22:24:42,280 INFO L322 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2023-11-06 22:24:42,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 67 [2023-11-06 22:24:42,342 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:24:42,343 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 47 [2023-11-06 22:24:42,443 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 22:24:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:42,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:24:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:42,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996278673] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:24:42,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:24:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2023-11-06 22:24:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159839793] [2023-11-06 22:24:42,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:24:42,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 22:24:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:24:42,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=397, Unknown=21, NotChecked=42, Total=552 [2023-11-06 22:24:42,912 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:44,531 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse13 (select .cse14 0)) (.cse1 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse8 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse11 (not .cse8)) (.cse15 (not .cse1)) (.cse2 (<= .cse13 0))) (let ((.cse9 (and .cse15 (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_7))) (and (= (store (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse13) .cse14) (= v_DerPreprocessor_5 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) .cse2)) (.cse10 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_3))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= v_DerPreprocessor_2 .cse19) (= v_DerPreprocessor_1 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store .cse19 0 .cse13) .cse14)))))) (.cse0 (and (not .cse7) (or (and .cse15 .cse2) (and (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (= (store (select (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_9))) (store .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| |ULTIMATE.start_test_fun_~y#1|))) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse13) .cse14)) .cse2)) .cse11)) (.cse4 (exists ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_11) (= .cse14 (store .cse17 0 .cse13)) (= v_DerPreprocessor_12 .cse17)))))) (.cse6 (and (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_17))) (and (= (store (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse13) .cse14) (= (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_15)))) .cse15 .cse2))) (and (<= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (let ((.cse5 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0))) (let ((.cse3 (not .cse5))) (or .cse0 (and (or (and .cse1 .cse2 (or (and .cse3 .cse4) (and .cse5 .cse4))) .cse6) .cse7) (and .cse8 (or .cse9 (and .cse1 (or (and .cse3 .cse10) (and .cse5 .cse10)) .cse2)))))) .cse11 (or (and .cse8 (or .cse9 (and .cse1 .cse10 .cse2))) .cse0 (and .cse7 (or (and .cse1 .cse4 .cse2) .cse6))) (<= 0 (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 2147483647)) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))))) is different from true [2023-11-06 22:24:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:44,996 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-11-06 22:24:44,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:24:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-06 22:24:44,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:44,999 INFO L225 Difference]: With dead ends: 52 [2023-11-06 22:24:44,999 INFO L226 Difference]: Without dead ends: 51 [2023-11-06 22:24:45,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=237, Invalid=979, Unknown=52, NotChecked=138, Total=1406 [2023-11-06 22:24:45,000 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 17 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:45,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 96 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 190 Invalid, 27 Unknown, 73 Unchecked, 0.4s Time] [2023-11-06 22:24:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-06 22:24:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2023-11-06 22:24:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-11-06 22:24:45,010 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 14 [2023-11-06 22:24:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:45,010 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-11-06 22:24:45,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-11-06 22:24:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:24:45,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:45,012 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:45,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:45,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:45,218 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:45,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:45,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156546, now seen corresponding path program 1 times [2023-11-06 22:24:45,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:45,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715776003] [2023-11-06 22:24:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715776003] [2023-11-06 22:24:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715776003] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181787716] [2023-11-06 22:24:45,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:45,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:45,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:45,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:45,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:24:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:45,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:24:45,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:45,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:24:45,764 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:45,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-06 22:24:45,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:24:45,825 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:24:45,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:24:45,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:45,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-06 22:24:45,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 1 [2023-11-06 22:24:45,903 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 22:24:45,933 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 22:24:45,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2023-11-06 22:24:45,958 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 22:24:45,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2023-11-06 22:24:45,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 22:24:45,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-06 22:24:46,005 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-06 22:24:46,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:24:46,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:24:46,032 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:46,033 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-06 22:24:46,039 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:46,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-06 22:24:46,049 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:24:46,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:24:46,065 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:46,066 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-06 22:24:46,072 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:46,073 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:24:46,074 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-11-06 22:24:46,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:24:46,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:24:46,360 WARN L861 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select .cse4 0))) (let ((.cse1 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (<= .cse6 0))) (or (and (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) .cse0) (and .cse1 (let ((.cse2 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse3 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_24))) (and (= .cse4 (store (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse6)) (= v_DerPreprocessor_22 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))) (or (and .cse2 .cse3) (and (not .cse2) .cse3))) .cse0) (and (not .cse1) (or (and (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) .cse0) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= .cse4 (store .cse7 0 .cse6)) (= v_DerPreprocessor_31 .cse7)))) .cse0))))))) (or |c_ULTIMATE.start_test_fun_#t~short7#1| (< 0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) is different from true [2023-11-06 22:24:46,853 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:24:46,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 257 [2023-11-06 22:24:46,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 172 [2023-11-06 22:24:46,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 167 [2023-11-06 22:24:46,928 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:24:46,938 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:24:46,945 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:24:46,965 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:24:46,994 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:24:47,033 INFO L351 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 7 treesize of output 5 [2023-11-06 22:24:47,049 INFO L351 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 7 treesize of output 5 [2023-11-06 22:24:47,061 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:24:47,071 INFO L351 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 7 treesize of output 5 [2023-11-06 22:24:47,097 INFO L351 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 5 treesize of output 3 [2023-11-06 22:24:47,143 INFO L351 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 11 treesize of output 7 [2023-11-06 22:24:47,158 INFO L351 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 11 treesize of output 7 [2023-11-06 22:24:47,165 INFO L351 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 24 treesize of output 20 [2023-11-06 22:24:47,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:24:47,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:24:47,407 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 22:24:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:47,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:24:47,559 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:24:47,559 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-06 22:24:47,569 INFO L351 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 36 treesize of output 28 [2023-11-06 22:24:47,583 INFO L351 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 7 treesize of output 5 [2023-11-06 22:24:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:47,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181787716] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:24:47,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:24:47,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2023-11-06 22:24:47,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644081204] [2023-11-06 22:24:47,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:24:47,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 22:24:47,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:47,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 22:24:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=492, Unknown=36, NotChecked=48, Total=702 [2023-11-06 22:24:47,816 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:47,839 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select .cse6 0)) (.cse8 (not .cse1))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 (+ 2147483648 .cse0)) (let ((.cse3 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse2 (<= .cse0 0))) (or (and .cse1 .cse2) (and .cse3 (let ((.cse4 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse5 (exists ((v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_24))) (and (= .cse6 (store (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse0)) (= v_DerPreprocessor_22 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))))) (or (and .cse4 .cse5) (and (not .cse4) .cse5))) .cse2) (and (not .cse3) .cse8 (or (and (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) .cse2) (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= .cse6 (store .cse9 0 .cse0)) (= v_DerPreprocessor_31 .cse9)))) .cse2))))) .cse8 (= (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2023-11-06 22:24:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:48,546 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2023-11-06 22:24:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:24:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-06 22:24:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:48,547 INFO L225 Difference]: With dead ends: 38 [2023-11-06 22:24:48,547 INFO L226 Difference]: Without dead ends: 37 [2023-11-06 22:24:48,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=259, Invalid=877, Unknown=62, NotChecked=134, Total=1332 [2023-11-06 22:24:48,549 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 72 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 28 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:48,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 39 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 154 Invalid, 9 Unknown, 46 Unchecked, 0.2s Time] [2023-11-06 22:24:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-06 22:24:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-06 22:24:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-11-06 22:24:48,556 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 15 [2023-11-06 22:24:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:48,556 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-11-06 22:24:48,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-11-06 22:24:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:24:48,558 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:48,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:48,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:48,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:48,764 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:48,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1334656582, now seen corresponding path program 1 times [2023-11-06 22:24:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095149166] [2023-11-06 22:24:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095149166] [2023-11-06 22:24:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095149166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754882322] [2023-11-06 22:24:49,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:49,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:49,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:49,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:49,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:24:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:49,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 22:24:49,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:49,166 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:24:49,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-11-06 22:24:49,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:49,180 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-06 22:24:49,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:24:49,247 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-11-06 22:24:49,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2023-11-06 22:24:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:49,435 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:49,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754882322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:49,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:24:49,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2023-11-06 22:24:49,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342476160] [2023-11-06 22:24:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:49,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:49,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:49,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:49,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:24:49,438 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:49,511 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-11-06 22:24:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:49,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:24:49,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:49,513 INFO L225 Difference]: With dead ends: 57 [2023-11-06 22:24:49,513 INFO L226 Difference]: Without dead ends: 47 [2023-11-06 22:24:49,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:24:49,514 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:49,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:24:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-06 22:24:49,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2023-11-06 22:24:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2023-11-06 22:24:49,522 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 16 [2023-11-06 22:24:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:49,522 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2023-11-06 22:24:49,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2023-11-06 22:24:49,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:24:49,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:49,523 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:49,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:49,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:49,733 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:49,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1820880262, now seen corresponding path program 1 times [2023-11-06 22:24:49,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:49,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819272786] [2023-11-06 22:24:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:49,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:50,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819272786] [2023-11-06 22:24:50,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819272786] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:50,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001245412] [2023-11-06 22:24:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:50,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:50,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:50,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:50,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:24:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:50,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:24:50,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:50,158 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:24:50,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:50,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:50,364 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_int_34| input size 24 context size 24 output size 24 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:330) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyEliminationToAtom(QuantifierPusher.java:291) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 22:24:50,368 INFO L158 Benchmark]: Toolchain (without parser) took 15141.25ms. Allocated memory was 157.3MB in the beginning and 314.6MB in the end (delta: 157.3MB). Free memory was 110.7MB in the beginning and 155.6MB in the end (delta: -44.9MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,369 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 157.3MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:50,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.25ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 94.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.19ms. Allocated memory is still 157.3MB. Free memory was 94.6MB in the beginning and 92.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,369 INFO L158 Benchmark]: Boogie Preprocessor took 29.51ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 91.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:50,370 INFO L158 Benchmark]: RCFGBuilder took 382.19ms. Allocated memory is still 157.3MB. Free memory was 91.1MB in the beginning and 78.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,370 INFO L158 Benchmark]: TraceAbstraction took 14197.75ms. Allocated memory was 157.3MB in the beginning and 314.6MB in the end (delta: 157.3MB). Free memory was 78.2MB in the beginning and 155.6MB in the end (delta: -77.4MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:50,372 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.26ms. Allocated memory is still 157.3MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.25ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 94.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.19ms. Allocated memory is still 157.3MB. Free memory was 94.6MB in the beginning and 92.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.51ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 91.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 382.19ms. Allocated memory is still 157.3MB. Free memory was 91.1MB in the beginning and 78.8MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14197.75ms. Allocated memory was 157.3MB in the beginning and 314.6MB in the end (delta: 157.3MB). Free memory was 78.2MB in the beginning and 155.6MB in the end (delta: -77.4MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_int_34| input size 24 context size 24 output size 24 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_int_34| input size 24 context size 24 output size 24: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:330) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:24:50,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:24:53,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:24:53,189 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2023-11-06 22:24:53,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:24:53,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:24:53,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-11-06 22:24:53,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:24:53,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:24:53,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:24:53,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:24:53,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:24:53,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:24:53,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:24:53,257 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:24:53,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:24:53,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:24:53,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:24:53,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:24:53,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:24:53,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:24:53,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:24:53,262 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:24:53,262 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:24:53,262 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:24:53,263 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:24:53,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:24:53,264 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:24:53,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:24:53,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:24:53,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:24:53,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:53,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:24:53,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:24:53,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:24:53,267 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:24:53,268 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:24:53,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:24:53,268 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:24:53,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:24:53,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:24:53,270 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:24:53,270 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:24:53,270 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b [2023-11-06 22:24:53,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:24:53,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:24:53,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:24:53,717 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:24:53,719 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:24:53,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2023-11-06 22:24:57,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:24:57,258 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:24:57,258 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2023-11-06 22:24:57,278 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/data/f5ee7ebc8/7d797d64a68d4fd8b52a035b7fd200ef/FLAG205ff2078 [2023-11-06 22:24:57,298 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/data/f5ee7ebc8/7d797d64a68d4fd8b52a035b7fd200ef [2023-11-06 22:24:57,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:24:57,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:24:57,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:57,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:24:57,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:24:57,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:57,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8b260c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57, skipping insertion in model container [2023-11-06 22:24:57,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:57,354 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:24:57,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:57,809 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:24:57,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:57,926 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:24:57,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57 WrapperNode [2023-11-06 22:24:57,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:57,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:57,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:24:57,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:24:57,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:57,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,006 INFO L138 Inliner]: procedures = 112, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2023-11-06 22:24:58,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:58,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:24:58,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:24:58,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:24:58,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:24:58,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:24:58,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:24:58,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:24:58,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (1/1) ... [2023-11-06 22:24:58,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:58,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:58,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:24:58,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:24:58,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:24:58,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:24:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:24:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:24:58,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:24:58,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:24:58,344 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:24:58,347 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:24:58,578 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:24:58,587 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:24:58,588 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:24:58,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:58 BoogieIcfgContainer [2023-11-06 22:24:58,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:24:58,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:24:58,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:24:58,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:24:58,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:57" (1/3) ... [2023-11-06 22:24:58,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a613ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:58, skipping insertion in model container [2023-11-06 22:24:58,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:57" (2/3) ... [2023-11-06 22:24:58,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a613ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:58, skipping insertion in model container [2023-11-06 22:24:58,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:58" (3/3) ... [2023-11-06 22:24:58,618 INFO L112 eAbstractionObserver]: Analyzing ICFG b.09-no-inv_assume-alloca.i [2023-11-06 22:24:58,637 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:24:58,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-06 22:24:58,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:24:58,711 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=LoopsAndPotentialCycles, 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;@3c64eda7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:24:58,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 22:24:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:24:58,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:58,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:58,725 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:58,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:58,733 INFO L85 PathProgramCache]: Analyzing trace with hash 123263665, now seen corresponding path program 1 times [2023-11-06 22:24:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:58,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723333150] [2023-11-06 22:24:58,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:58,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:58,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:58,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:58,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:24:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:58,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:24:58,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:58,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:58,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:24:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723333150] [2023-11-06 22:24:58,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723333150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:58,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:58,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:58,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125149253] [2023-11-06 22:24:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:58,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:24:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:58,956 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:59,004 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2023-11-06 22:24:59,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 22:24:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:59,012 INFO L225 Difference]: With dead ends: 37 [2023-11-06 22:24:59,012 INFO L226 Difference]: Without dead ends: 14 [2023-11-06 22:24:59,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:59,018 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:59,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-11-06 22:24:59,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-11-06 22:24:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-11-06 22:24:59,050 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 8 [2023-11-06 22:24:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:59,051 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-11-06 22:24:59,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-11-06 22:24:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:24:59,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:59,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:59,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-06 22:24:59,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:59,266 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:59,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash 180521967, now seen corresponding path program 1 times [2023-11-06 22:24:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:59,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42026510] [2023-11-06 22:24:59,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:59,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:59,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:59,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:24:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:59,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:24:59,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:59,505 INFO L351 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 16 treesize of output 8 [2023-11-06 22:24:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:59,524 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:59,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:24:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42026510] [2023-11-06 22:24:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42026510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:59,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:59,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:59,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166537874] [2023-11-06 22:24:59,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:59,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:59,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:24:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:59,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:59,539 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:59,693 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2023-11-06 22:24:59,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:59,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-06 22:24:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:59,713 INFO L225 Difference]: With dead ends: 20 [2023-11-06 22:24:59,713 INFO L226 Difference]: Without dead ends: 19 [2023-11-06 22:24:59,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:59,715 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:59,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:24:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-06 22:24:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2023-11-06 22:24:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-11-06 22:24:59,727 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 8 [2023-11-06 22:24:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:59,727 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-11-06 22:24:59,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-11-06 22:24:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:24:59,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:59,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:59,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:59,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:59,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-06 22:24:59,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1682864823, now seen corresponding path program 1 times [2023-11-06 22:24:59,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:59,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171082394] [2023-11-06 22:24:59,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:59,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:59,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:59,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:59,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:25:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:25:00,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:25:00,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:25:00,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:25:00,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171082394] [2023-11-06 22:25:00,150 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 22:25:00,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:25:00,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:25:00,364 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_int_17| input size 25 context size 25 output size 25 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:330) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyEliminationToAtom(QuantifierPusher.java:291) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 22:25:00,368 INFO L158 Benchmark]: Toolchain (without parser) took 3063.04ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 40.3MB in the beginning and 61.4MB in the end (delta: -21.1MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2023-11-06 22:25:00,368 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 71.3MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:25:00,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.99ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 40.0MB in the beginning and 65.9MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:25:00,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.38ms. Allocated memory is still 96.5MB. Free memory was 65.9MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:25:00,370 INFO L158 Benchmark]: Boogie Preprocessor took 68.49ms. Allocated memory is still 96.5MB. Free memory was 63.9MB in the beginning and 62.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:25:00,370 INFO L158 Benchmark]: RCFGBuilder took 514.25ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 49.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:25:00,372 INFO L158 Benchmark]: TraceAbstraction took 1757.71ms. Allocated memory is still 96.5MB. Free memory was 74.1MB in the beginning and 61.4MB in the end (delta: 12.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2023-11-06 22:25:00,375 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.31ms. Allocated memory is still 71.3MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 620.99ms. Allocated memory was 71.3MB in the beginning and 96.5MB in the end (delta: 25.2MB). Free memory was 40.0MB in the beginning and 65.9MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.38ms. Allocated memory is still 96.5MB. Free memory was 65.9MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.49ms. Allocated memory is still 96.5MB. Free memory was 63.9MB in the beginning and 62.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 514.25ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 49.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1757.71ms. Allocated memory is still 96.5MB. Free memory was 74.1MB in the beginning and 61.4MB in the end (delta: 12.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_int_17| input size 25 context size 25 output size 25 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_int_17| input size 25 context size 25 output size 25: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:330) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:25:00,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56f77a23-7fb3-4153-8990-0169de032807/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_int_17| input size 25 context size 25 output size 25