./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:47:36,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:47:36,176 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-64bit-Taipan_Default.epf [2023-11-12 00:47:36,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:47:36,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:47:36,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:47:36,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:47:36,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:47:36,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:47:36,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:47:36,230 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:47:36,231 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:47:36,231 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:47:36,233 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:47:36,233 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:47:36,234 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:47:36,234 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:47:36,235 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:47:36,237 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:47:36,237 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:47:36,238 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:47:36,238 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:47:36,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:47:36,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:47:36,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:47:36,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:47:36,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:47:36,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:47:36,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:47:36,243 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:47:36,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:47:36,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:47:36,245 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:47:36,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:47:36,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:47:36,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:47:36,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:47:36,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:47:36,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:47:36,247 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:47:36,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:47:36,248 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:47:36,248 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:47:36,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:47:36,249 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/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_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> 64e9a02fe4d55a12958b5de8c28c6c0ab007c7a3dc976261fd9d4ec11bf5feff [2023-11-12 00:47:36,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:47:36,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:47:36,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:47:36,580 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:47:36,580 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:47:36,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2023-11-12 00:47:39,625 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:47:39,951 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:47:39,952 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2023-11-12 00:47:39,969 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/data/4e1f41011/174d5197113a4aeaad6c2f96fc4736c8/FLAGa34bdcf92 [2023-11-12 00:47:39,989 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/data/4e1f41011/174d5197113a4aeaad6c2f96fc4736c8 [2023-11-12 00:47:39,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:47:39,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:47:39,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:47:39,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:47:40,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:47:40,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:47:39" (1/1) ... [2023-11-12 00:47:40,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2892f1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40, skipping insertion in model container [2023-11-12 00:47:40,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:47:39" (1/1) ... [2023-11-12 00:47:40,071 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:47:40,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:47:40,439 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:47:40,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:47:40,504 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:47:40,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40 WrapperNode [2023-11-12 00:47:40,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:47:40,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:47:40,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:47:40,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:47:40,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,552 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2023-11-12 00:47:40,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:47:40,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:47:40,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:47:40,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:47:40,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:47:40,583 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:47:40,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:47:40,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:47:40,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (1/1) ... [2023-11-12 00:47:40,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:47:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:47:40,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:47:40,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:47:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:47:40,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:47:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:47:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:47:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:47:40,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:47:40,795 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:47:40,797 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:47:41,062 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:47:41,143 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:47:41,143 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-12 00:47:41,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:47:41 BoogieIcfgContainer [2023-11-12 00:47:41,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:47:41,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:47:41,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:47:41,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:47:41,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:47:39" (1/3) ... [2023-11-12 00:47:41,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7f41f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:47:41, skipping insertion in model container [2023-11-12 00:47:41,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:47:40" (2/3) ... [2023-11-12 00:47:41,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7f41f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:47:41, skipping insertion in model container [2023-11-12 00:47:41,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:47:41" (3/3) ... [2023-11-12 00:47:41,156 INFO L112 eAbstractionObserver]: Analyzing ICFG b.18-alloca.i [2023-11-12 00:47:41,178 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:47:41,178 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-12 00:47:41,230 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:47:41,238 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b44e2be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:47:41,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 00:47:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:47:41,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:41,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:47:41,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:41,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash 107124014, now seen corresponding path program 1 times [2023-11-12 00:47:41,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:41,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773721079] [2023-11-12 00:47:41,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:41,437 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-12 00:47:41,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:41,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773721079] [2023-11-12 00:47:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773721079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:41,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:41,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:47:41,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160946951] [2023-11-12 00:47:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:41,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:47:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:47:41,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:47:41,497 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-12 00:47:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:41,526 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-11-12 00:47:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:47:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-11-12 00:47:41,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:41,536 INFO L225 Difference]: With dead ends: 47 [2023-11-12 00:47:41,537 INFO L226 Difference]: Without dead ends: 22 [2023-11-12 00:47:41,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:47:41,544 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:41,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:47:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-12 00:47:41,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-12 00:47:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 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-12 00:47:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-12 00:47:41,583 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 5 [2023-11-12 00:47:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:41,584 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-12 00:47:41,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-12 00:47:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-12 00:47:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:47:41,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:41,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:47:41,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:47:41,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:41,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash -949412627, now seen corresponding path program 1 times [2023-11-12 00:47:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:41,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829202323] [2023-11-12 00:47:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:42,462 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-12 00:47:42,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:42,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829202323] [2023-11-12 00:47:42,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829202323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:42,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:42,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:47:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343700890] [2023-11-12 00:47:42,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:42,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:47:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:42,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:47:42,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:47:42,470 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-12 00:47:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:42,664 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-11-12 00:47:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:47:42,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2023-11-12 00:47:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:42,666 INFO L225 Difference]: With dead ends: 43 [2023-11-12 00:47:42,666 INFO L226 Difference]: Without dead ends: 42 [2023-11-12 00:47:42,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:47:42,668 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:42,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 49 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:47:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-12 00:47:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2023-11-12 00:47:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.5) internal successors, (39), 31 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-12 00:47:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-11-12 00:47:42,677 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 6 [2023-11-12 00:47:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:42,678 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-11-12 00:47:42,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-12 00:47:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-11-12 00:47:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:47:42,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:42,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:42,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:47:42,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:42,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash 632979741, now seen corresponding path program 1 times [2023-11-12 00:47:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:42,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604807924] [2023-11-12 00:47:42,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:42,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:43,078 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-12 00:47:43,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:43,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604807924] [2023-11-12 00:47:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604807924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:43,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:43,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:47:43,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018807815] [2023-11-12 00:47:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:43,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:47:43,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:43,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:47:43,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:47:43,085 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-12 00:47:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:43,200 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2023-11-12 00:47:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:47:43,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2023-11-12 00:47:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:43,203 INFO L225 Difference]: With dead ends: 32 [2023-11-12 00:47:43,203 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:47:43,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:47:43,213 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:43,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 30 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:47:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:47:43,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 00:47:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 26 states have internal predecessors, (33), 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-12 00:47:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-12 00:47:43,225 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 7 [2023-11-12 00:47:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:43,225 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-12 00:47:43,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-12 00:47:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-11-12 00:47:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:47:43,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:43,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:43,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:47:43,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:43,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 632844786, now seen corresponding path program 1 times [2023-11-12 00:47:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147635209] [2023-11-12 00:47:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:43,331 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-12 00:47:43,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:43,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147635209] [2023-11-12 00:47:43,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147635209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:43,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:43,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:47:43,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450779821] [2023-11-12 00:47:43,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:43,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:47:43,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:47:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:47:43,334 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-12 00:47:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:43,384 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2023-11-12 00:47:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:47:43,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2023-11-12 00:47:43,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:43,386 INFO L225 Difference]: With dead ends: 27 [2023-11-12 00:47:43,386 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 00:47:43,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:47:43,397 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:43,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 36 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:47:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 00:47:43,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-12 00:47:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2023-11-12 00:47:43,403 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 7 [2023-11-12 00:47:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:43,404 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2023-11-12 00:47:43,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-12 00:47:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2023-11-12 00:47:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:47:43,405 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:43,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:43,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:47:43,405 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:43,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash 633429682, now seen corresponding path program 1 times [2023-11-12 00:47:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:43,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914912837] [2023-11-12 00:47:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:43,510 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-12 00:47:43,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914912837] [2023-11-12 00:47:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914912837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:43,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:43,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:47:43,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113220871] [2023-11-12 00:47:43,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:43,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:47:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:43,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:47:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:47:43,514 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-12 00:47:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:43,559 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2023-11-12 00:47:43,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:47:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2023-11-12 00:47:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:43,563 INFO L225 Difference]: With dead ends: 26 [2023-11-12 00:47:43,564 INFO L226 Difference]: Without dead ends: 25 [2023-11-12 00:47:43,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:47:43,565 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:43,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:47:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-12 00:47:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-12 00:47:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2023-11-12 00:47:43,581 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 7 [2023-11-12 00:47:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:43,581 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2023-11-12 00:47:43,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-12 00:47:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2023-11-12 00:47:43,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:47:43,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:43,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:43,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:47:43,583 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:43,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:43,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1856648049, now seen corresponding path program 1 times [2023-11-12 00:47:43,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:43,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085669259] [2023-11-12 00:47:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:43,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:43,780 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-12 00:47:43,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:43,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085669259] [2023-11-12 00:47:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085669259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:43,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:43,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:47:43,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111233818] [2023-11-12 00:47:43,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:43,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:47:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:47:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:47:43,783 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.6) 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-12 00:47:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:43,822 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2023-11-12 00:47:43,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:47:43,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) 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-12 00:47:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:43,823 INFO L225 Difference]: With dead ends: 25 [2023-11-12 00:47:43,824 INFO L226 Difference]: Without dead ends: 24 [2023-11-12 00:47:43,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:47:43,825 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:43,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 16 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:47:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-12 00:47:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-12 00:47:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 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-12 00:47:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-12 00:47:43,836 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 8 [2023-11-12 00:47:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:43,837 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-12 00:47:43,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) 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-12 00:47:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-12 00:47:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:47:43,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:43,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:43,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:47:43,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:43,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1838516254, now seen corresponding path program 1 times [2023-11-12 00:47:43,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:43,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485660905] [2023-11-12 00:47:43,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:43,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:43,907 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-12 00:47:43,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:43,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485660905] [2023-11-12 00:47:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485660905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:47:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:47:43,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:47:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487609008] [2023-11-12 00:47:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:47:43,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:47:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:43,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:47:43,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:47:43,910 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 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-12 00:47:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:43,944 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2023-11-12 00:47:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:47:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-12 00:47:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:43,945 INFO L225 Difference]: With dead ends: 24 [2023-11-12 00:47:43,945 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 00:47:43,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:47:43,946 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:43,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:47:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 00:47:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 00:47:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2023-11-12 00:47:43,958 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 8 [2023-11-12 00:47:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:43,958 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-12 00:47:43,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-12 00:47:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2023-11-12 00:47:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:47:43,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:43,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:43,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:47:43,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:43,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1456134612, now seen corresponding path program 1 times [2023-11-12 00:47:43,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:43,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977403239] [2023-11-12 00:47:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:43,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:44,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:44,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977403239] [2023-11-12 00:47:44,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977403239] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:47:44,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419225599] [2023-11-12 00:47:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:44,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:47:44,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:47:44,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:47:44,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:47:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:44,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-12 00:47:44,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:47:44,875 INFO L322 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2023-11-12 00:47:44,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 37 [2023-11-12 00:47:44,985 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:47:44,986 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 62 treesize of output 66 [2023-11-12 00:47:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:45,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:47:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419225599] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:47:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076804986] [2023-11-12 00:47:45,237 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-12 00:47:45,238 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:47:45,241 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:47:45,247 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:47:45,247 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:47:47,707 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:47:50,869 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '658#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |ULTIMATE.start_test_fun_#t~mem17#1|) (<= |ULTIMATE.start_main_#t~nondet19#1| 2147483647) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_main_#t~nondet18#1| 2147483647) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem17#1| |ULTIMATE.start_test_fun_#t~mem16#1|) 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet18#1|)) (or (exists ((|v_ULTIMATE.start_test_fun_#t~mem5#1_27| Int) (|v_ULTIMATE.start_test_fun_#t~mem5#1_28| Int) (|v_ULTIMATE.start_test_fun_#t~short6#1_18| Bool)) (and (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem5#1_28|)) (and (= |v_ULTIMATE.start_test_fun_#t~mem5#1_28| |v_ULTIMATE.start_test_fun_#t~mem5#1_27|) (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|))) (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 0))))) (and (= |ULTIMATE.start_test_fun_~x#1| |ULTIMATE.start_test_fun_#in~x#1|) (exists ((|v_ULTIMATE.start_test_fun_#t~mem5#1_28| Int) (|v_ULTIMATE.start_test_fun_#t~short6#1_18| Bool) (|v_ULTIMATE.start_test_fun_#t~mem5#1_21| Int)) (and (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem5#1_28|)) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (= |v_ULTIMATE.start_test_fun_#t~mem5#1_21| |v_ULTIMATE.start_test_fun_#t~mem5#1_28|))) (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 0))))) (= |ULTIMATE.start_main_#t~nondet18#1| |ULTIMATE.start_test_fun_#in~x#1|) (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (= |ULTIMATE.start_test_fun_~y#1| |ULTIMATE.start_test_fun_#in~y#1|) (= |ULTIMATE.start_main_#t~nondet19#1| |ULTIMATE.start_test_fun_#in~y#1|) (exists ((|v_#length_8| (Array Int Int))) (= |#length| (store (store |v_#length_8| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 4) |ULTIMATE.start_test_fun_#t~malloc3#1.base| 4))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (exists ((|v_#valid_15| (Array Int Int))) (and (= (select |v_#valid_15| |ULTIMATE.start_test_fun_#t~malloc2#1.base|) 0) (= 0 (select (store |v_#valid_15| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base|)) (= (store (store |v_#valid_15| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base| 1) |#valid|) (= (select |v_#valid_15| 0) 0))) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet19#1|)) (exists ((|v_#memory_int_28| (Array Int (Array Int Int)))) (= |#memory_int| (store (store |v_#memory_int_28| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |v_#memory_int_28| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~x#1|)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store |v_#memory_int_28| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |v_#memory_int_28| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~x#1|)) |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)))))) (= |ULTIMATE.start_test_fun_#t~mem16#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (<= 2 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (exists ((|v_ULTIMATE.start_test_fun_#t~mem14#1_19| Int) (|v_ULTIMATE.start_test_fun_#t~mem14#1_18| Int) (|v_ULTIMATE.start_test_fun_#t~short15#1_18| Bool)) (and (or (and (<= 0 |v_ULTIMATE.start_test_fun_#t~mem14#1_19|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem14#1_19|)) (and (= |v_ULTIMATE.start_test_fun_#t~mem14#1_19| |v_ULTIMATE.start_test_fun_#t~mem14#1_18|) (not |v_ULTIMATE.start_test_fun_#t~short15#1_18|))) (or |v_ULTIMATE.start_test_fun_#t~short15#1_18| (< 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 1))))))' at error location [2023-11-12 00:47:50,869 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:47:50,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:47:50,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-11-12 00:47:50,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150519660] [2023-11-12 00:47:50,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:47:50,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-12 00:47:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-12 00:47:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2023-11-12 00:47:50,873 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:51,304 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2023-11-12 00:47:51,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:47:51,305 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-12 00:47:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:51,306 INFO L225 Difference]: With dead ends: 64 [2023-11-12 00:47:51,306 INFO L226 Difference]: Without dead ends: 42 [2023-11-12 00:47:51,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2023-11-12 00:47:51,308 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:51,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:47:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-12 00:47:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2023-11-12 00:47:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-11-12 00:47:51,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 15 [2023-11-12 00:47:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:51,315 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-11-12 00:47:51,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-11-12 00:47:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:47:51,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:51,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:51,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:47:51,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:47:51,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:51,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:51,523 INFO L85 PathProgramCache]: Analyzing trace with hash 773726489, now seen corresponding path program 1 times [2023-11-12 00:47:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:51,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586061595] [2023-11-12 00:47:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:51,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:51,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586061595] [2023-11-12 00:47:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586061595] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:47:51,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457148559] [2023-11-12 00:47:51,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:51,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:47:51,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:47:51,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:47:51,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:47:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:52,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-12 00:47:52,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:47:52,053 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-12 00:47:52,068 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:47:52,069 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 1 case distinctions, treesize of input 18 treesize of output 17 [2023-11-12 00:47:52,266 INFO L322 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-12 00:47:52,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 37 [2023-11-12 00:47:52,395 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:47:52,395 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2023-11-12 00:47:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:52,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:47:52,668 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-12 00:47:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457148559] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:47:52,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1244162593] [2023-11-12 00:47:52,671 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-12 00:47:52,671 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:47:52,671 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:47:52,671 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:47:52,672 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:47:54,292 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:47:57,091 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '899#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |ULTIMATE.start_test_fun_#t~mem17#1|) (<= |ULTIMATE.start_main_#t~nondet19#1| 2147483647) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_main_#t~nondet18#1| 2147483647) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem17#1| |ULTIMATE.start_test_fun_#t~mem16#1|) 0) (or (and (= |ULTIMATE.start_test_fun_~x#1| |ULTIMATE.start_test_fun_#in~x#1|) (exists ((|v_#valid_16| (Array Int Int))) (and (= (store (store |v_#valid_16| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base| 1) |#valid|) (= (select (store |v_#valid_16| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base|) 0) (= (select |v_#valid_16| 0) 0) (= (select |v_#valid_16| |ULTIMATE.start_test_fun_#t~malloc2#1.base|) 0))) (= |ULTIMATE.start_main_#t~nondet18#1| |ULTIMATE.start_test_fun_#in~x#1|) (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (exists ((|v_ULTIMATE.start_test_fun_#t~mem5#1_33| Int) (|v_ULTIMATE.start_test_fun_#t~mem5#1_40| Int) (|v_ULTIMATE.start_test_fun_#t~short6#1_18| Bool)) (and (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem5#1_40|)) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (= |v_ULTIMATE.start_test_fun_#t~mem5#1_33| |v_ULTIMATE.start_test_fun_#t~mem5#1_40|))) (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 0))))) (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (= |ULTIMATE.start_test_fun_~y#1| |ULTIMATE.start_test_fun_#in~y#1|) (= |ULTIMATE.start_main_#t~nondet19#1| |ULTIMATE.start_test_fun_#in~y#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (exists ((|v_#memory_int_38| (Array Int (Array Int Int)))) (= (store (store |v_#memory_int_38| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |v_#memory_int_38| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~x#1|)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store |v_#memory_int_38| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |v_#memory_int_38| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~x#1|)) |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |#memory_int|)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet19#1|)) (exists ((|v_#length_9| (Array Int Int))) (= |#length| (store (store |v_#length_9| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 4) |ULTIMATE.start_test_fun_#t~malloc3#1.base| 4)))) (exists ((|v_ULTIMATE.start_test_fun_#t~mem5#1_39| Int) (|v_ULTIMATE.start_test_fun_#t~mem5#1_40| Int) (|v_ULTIMATE.start_test_fun_#t~short6#1_18| Bool)) (and (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 0))) (or (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (= |v_ULTIMATE.start_test_fun_#t~mem5#1_39| |v_ULTIMATE.start_test_fun_#t~mem5#1_40|)) (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem5#1_40|)))))) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet18#1|)) (= |ULTIMATE.start_test_fun_#t~mem16#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (<= 2 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (exists ((|v_ULTIMATE.start_test_fun_#t~mem14#1_22| Int) (|v_ULTIMATE.start_test_fun_#t~mem14#1_23| Int) (|v_ULTIMATE.start_test_fun_#t~short15#1_18| Bool)) (and (or (and (not |v_ULTIMATE.start_test_fun_#t~short15#1_18|) (= |v_ULTIMATE.start_test_fun_#t~mem14#1_23| |v_ULTIMATE.start_test_fun_#t~mem14#1_22|)) (and (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem14#1_23|) (<= 0 |v_ULTIMATE.start_test_fun_#t~mem14#1_23|))) (or |v_ULTIMATE.start_test_fun_#t~short15#1_18| (< 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 1))))))' at error location [2023-11-12 00:47:57,091 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:47:57,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:47:57,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 18 [2023-11-12 00:47:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597152383] [2023-11-12 00:47:57,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:47:57,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-12 00:47:57,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:47:57,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-12 00:47:57,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2023-11-12 00:47:57,094 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 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-12 00:47:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:47:57,774 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2023-11-12 00:47:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-12 00:47:57,775 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 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-12 00:47:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:47:57,777 INFO L225 Difference]: With dead ends: 66 [2023-11-12 00:47:57,777 INFO L226 Difference]: Without dead ends: 59 [2023-11-12 00:47:57,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=263, Invalid=1377, Unknown=0, NotChecked=0, Total=1640 [2023-11-12 00:47:57,779 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 122 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:47:57,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 103 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:47:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-12 00:47:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 27. [2023-11-12 00:47:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:47:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-11-12 00:47:57,787 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 15 [2023-11-12 00:47:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:47:57,787 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-11-12 00:47:57,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 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-12 00:47:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-11-12 00:47:57,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-12 00:47:57,789 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:47:57,789 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:47:57,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:47:57,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:47:57,994 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:47:57,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:47:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash 901331493, now seen corresponding path program 2 times [2023-11-12 00:47:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:47:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604674512] [2023-11-12 00:47:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:47:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:47:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:47:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:58,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:47:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604674512] [2023-11-12 00:47:58,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604674512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:47:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135118545] [2023-11-12 00:47:58,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:47:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:47:58,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:47:58,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:47:58,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:47:58,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-12 00:47:58,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:47:58,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-12 00:47:58,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:47:58,693 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 24 treesize of output 32 [2023-11-12 00:47:58,698 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 40 treesize of output 21 [2023-11-12 00:47:58,701 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-12 00:47:58,710 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 19 treesize of output 32 [2023-11-12 00:47:58,725 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 40 treesize of output 21 [2023-11-12 00:47:58,731 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-12 00:47:58,736 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-12 00:47:58,740 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 10 treesize of output 8 [2023-11-12 00:47:58,961 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 43 treesize of output 23 [2023-11-12 00:47:59,053 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 43 treesize of output 23 [2023-11-12 00:47:59,148 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 31 treesize of output 15 [2023-11-12 00:47:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:59,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:47:59,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:47:59,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135118545] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:47:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1230048148] [2023-11-12 00:47:59,605 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-12 00:47:59,605 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:47:59,605 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:47:59,606 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:47:59,606 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:01,115 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:48:04,419 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1183#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |ULTIMATE.start_test_fun_#t~mem17#1|) (<= |ULTIMATE.start_main_#t~nondet19#1| 2147483647) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (exists ((|v_ULTIMATE.start_test_fun_#t~mem14#1_26| Int) (|v_ULTIMATE.start_test_fun_#t~mem14#1_27| Int) (|v_ULTIMATE.start_test_fun_#t~short15#1_18| Bool)) (and (or |v_ULTIMATE.start_test_fun_#t~short15#1_18| (< 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 1))) (or (and (<= 0 |v_ULTIMATE.start_test_fun_#t~mem14#1_27|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem14#1_27|)) (and (= |v_ULTIMATE.start_test_fun_#t~mem14#1_27| |v_ULTIMATE.start_test_fun_#t~mem14#1_26|) (not |v_ULTIMATE.start_test_fun_#t~short15#1_18|))))) (<= |ULTIMATE.start_main_#t~nondet18#1| 2147483647) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or (exists ((|v_ULTIMATE.start_test_fun_#t~mem5#1_52| Int) (|v_ULTIMATE.start_test_fun_#t~mem5#1_53| Int) (|v_ULTIMATE.start_test_fun_#t~short6#1_18| Bool)) (and (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 0))) (or (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (= |v_ULTIMATE.start_test_fun_#t~mem5#1_53| |v_ULTIMATE.start_test_fun_#t~mem5#1_52|)) (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem5#1_53|))))) (and (= |ULTIMATE.start_test_fun_~x#1| |ULTIMATE.start_test_fun_#in~x#1|) (= |ULTIMATE.start_main_#t~nondet18#1| |ULTIMATE.start_test_fun_#in~x#1|) (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (= |ULTIMATE.start_test_fun_~y#1| |ULTIMATE.start_test_fun_#in~y#1|) (exists ((|v_#valid_18| (Array Int Int))) (and (= (select |v_#valid_18| 0) 0) (= (select |v_#valid_18| |ULTIMATE.start_test_fun_#t~malloc2#1.base|) 0) (= (store (store |v_#valid_18| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base| 1) |#valid|) (= (select (store |v_#valid_18| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base|) 0))) (= |ULTIMATE.start_main_#t~nondet19#1| |ULTIMATE.start_test_fun_#in~y#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet19#1|)) (exists ((|v_#length_10| (Array Int Int))) (= (store (store |v_#length_10| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 4) |ULTIMATE.start_test_fun_#t~malloc3#1.base| 4) |#length|)) (exists ((|v_#memory_int_50| (Array Int (Array Int Int)))) (= |#memory_int| (store (store |v_#memory_int_50| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~x#1|)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store |v_#memory_int_50| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~x#1|)) |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)))) (exists ((|v_ULTIMATE.start_test_fun_#t~mem5#1_46| Int) (|v_ULTIMATE.start_test_fun_#t~mem5#1_53| Int) (|v_ULTIMATE.start_test_fun_#t~short6#1_18| Bool)) (and (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 0))) (or (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (= |v_ULTIMATE.start_test_fun_#t~mem5#1_46| |v_ULTIMATE.start_test_fun_#t~mem5#1_53|)) (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem5#1_53|))))))) (<= (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem17#1| |ULTIMATE.start_test_fun_#t~mem16#1|) 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet18#1|)) (= |ULTIMATE.start_test_fun_#t~mem16#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (<= 2 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647))' at error location [2023-11-12 00:48:04,419 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:48:04,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:48:04,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-11-12 00:48:04,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245731184] [2023-11-12 00:48:04,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:48:04,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-12 00:48:04,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-12 00:48:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2023-11-12 00:48:04,422 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 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-12 00:48:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:05,374 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2023-11-12 00:48:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-12 00:48:05,375 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 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 19 [2023-11-12 00:48:05,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:05,376 INFO L225 Difference]: With dead ends: 77 [2023-11-12 00:48:05,376 INFO L226 Difference]: Without dead ends: 61 [2023-11-12 00:48:05,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=488, Invalid=2374, Unknown=0, NotChecked=0, Total=2862 [2023-11-12 00:48:05,378 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 102 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:05,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 71 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:48:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-12 00:48:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 40. [2023-11-12 00:48:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 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-12 00:48:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-11-12 00:48:05,387 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 19 [2023-11-12 00:48:05,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:05,387 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-11-12 00:48:05,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 26 states have internal predecessors, (56), 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-12 00:48:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-11-12 00:48:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-12 00:48:05,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:48:05,389 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:05,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:48:05,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:48:05,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:48:05,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:48:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1079403255, now seen corresponding path program 3 times [2023-11-12 00:48:05,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:48:05,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960229112] [2023-11-12 00:48:05,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:48:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:48:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:48:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 45 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:48:06,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:48:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960229112] [2023-11-12 00:48:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960229112] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:48:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689893997] [2023-11-12 00:48:06,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 00:48:06,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:48:06,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:48:06,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:48:06,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:48:06,909 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 00:48:06,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:48:06,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-12 00:48:06,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:48:06,931 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 19 treesize of output 32 [2023-11-12 00:48:06,949 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 24 treesize of output 1 [2023-11-12 00:48:06,962 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 24 treesize of output 32 [2023-11-12 00:48:06,970 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-12 00:48:06,978 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 18 treesize of output 16 [2023-11-12 00:48:06,984 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (= (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) .cse0)))) is different from true [2023-11-12 00:48:07,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 00:48:07,406 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 35 treesize of output 24 [2023-11-12 00:48:07,430 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-12 00:48:07,435 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-12 00:48:07,496 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 16 treesize of output 11 [2023-11-12 00:48:07,520 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 16 treesize of output 11 [2023-11-12 00:48:07,542 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 16 treesize of output 11 [2023-11-12 00:48:07,571 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 16 treesize of output 11 [2023-11-12 00:48:07,703 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 43 treesize of output 23 [2023-11-12 00:48:07,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2023-11-12 00:48:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 14 refuted. 10 times theorem prover too weak. 28 trivial. 1 not checked. [2023-11-12 00:48:07,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:48:08,102 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:48:08,102 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 2 case distinctions, treesize of input 29 treesize of output 28 [2023-11-12 00:48:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-12 00:48:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689893997] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:48:08,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [218988751] [2023-11-12 00:48:08,561 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2023-11-12 00:48:08,561 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:48:08,561 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:48:08,562 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:48:08,562 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:48:10,105 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:48:14,141 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1623#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 2 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |ULTIMATE.start_test_fun_#t~mem17#1|) (exists ((|v_ULTIMATE.start_test_fun_#t~mem14#1_31| Int) (|v_ULTIMATE.start_test_fun_#t~mem14#1_30| Int) (|v_ULTIMATE.start_test_fun_#t~short15#1_18| Bool)) (and (or (and (<= 0 |v_ULTIMATE.start_test_fun_#t~mem14#1_31|) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem14#1_31|)) (and (not |v_ULTIMATE.start_test_fun_#t~short15#1_18|) (= |v_ULTIMATE.start_test_fun_#t~mem14#1_31| |v_ULTIMATE.start_test_fun_#t~mem14#1_30|))) (or |v_ULTIMATE.start_test_fun_#t~short15#1_18| (< 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 1))))) (<= |ULTIMATE.start_main_#t~nondet19#1| 2147483647) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (or (and (= |ULTIMATE.start_test_fun_~x#1| |ULTIMATE.start_test_fun_#in~x#1|) (exists ((|v_#valid_20| (Array Int Int))) (and (= (select (store |v_#valid_20| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base|) 0) (= (select |v_#valid_20| 0) 0) (= (store (store |v_#valid_20| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base| 1) |#valid|) (= (select |v_#valid_20| |ULTIMATE.start_test_fun_#t~malloc2#1.base|) 0))) (= |ULTIMATE.start_main_#t~nondet18#1| |ULTIMATE.start_test_fun_#in~x#1|) (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (exists ((|v_#length_11| (Array Int Int))) (= (store (store |v_#length_11| |ULTIMATE.start_test_fun_#t~malloc2#1.base| 4) |ULTIMATE.start_test_fun_#t~malloc3#1.base| 4) |#length|)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (= |ULTIMATE.start_test_fun_~y#1| |ULTIMATE.start_test_fun_#in~y#1|) (= |ULTIMATE.start_main_#t~nondet19#1| |ULTIMATE.start_test_fun_#in~y#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet19#1|)) (exists ((|v_ULTIMATE.start_test_fun_#t~mem5#1_66| Int) (|v_ULTIMATE.start_test_fun_#t~mem5#1_59| Int) (|v_ULTIMATE.start_test_fun_#t~short6#1_18| Bool)) (and (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 0))) (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem5#1_66|)) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (= |v_ULTIMATE.start_test_fun_#t~mem5#1_59| |v_ULTIMATE.start_test_fun_#t~mem5#1_66|))))) (exists ((|v_#memory_int_70| (Array Int (Array Int Int)))) (= (store (store |v_#memory_int_70| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~x#1|)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store |v_#memory_int_70| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~x#1|)) |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |#memory_int|))) (exists ((|v_ULTIMATE.start_test_fun_#t~mem5#1_66| Int) (|v_ULTIMATE.start_test_fun_#t~short6#1_18| Bool) (|v_ULTIMATE.start_test_fun_#t~mem5#1_65| Int)) (and (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (<= 1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 0))) (or (and |v_ULTIMATE.start_test_fun_#t~short6#1_18| (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) |v_ULTIMATE.start_test_fun_#t~mem5#1_66|)) (and (not |v_ULTIMATE.start_test_fun_#t~short6#1_18|) (= |v_ULTIMATE.start_test_fun_#t~mem5#1_65| |v_ULTIMATE.start_test_fun_#t~mem5#1_66|)))))) (<= |ULTIMATE.start_main_#t~nondet18#1| 2147483647) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem17#1| |ULTIMATE.start_test_fun_#t~mem16#1|) 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet18#1|)) (= |ULTIMATE.start_test_fun_#t~mem16#1| (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (<= 2 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 2 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 2 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647))' at error location [2023-11-12 00:48:14,141 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:48:14,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:48:14,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10, 10] total 41 [2023-11-12 00:48:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790527614] [2023-11-12 00:48:14,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:48:14,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-12 00:48:14,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:48:14,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-12 00:48:14,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=2012, Unknown=13, NotChecked=96, Total=2550 [2023-11-12 00:48:14,145 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 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-12 00:48:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:48:15,539 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2023-11-12 00:48:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-12 00:48:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 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 35 [2023-11-12 00:48:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:48:15,540 INFO L225 Difference]: With dead ends: 85 [2023-11-12 00:48:15,541 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 00:48:15,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=825, Invalid=3292, Unknown=47, NotChecked=126, Total=4290 [2023-11-12 00:48:15,544 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 135 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 8 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:48:15,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 112 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 275 Invalid, 54 Unknown, 68 Unchecked, 0.5s Time] [2023-11-12 00:48:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 00:48:15,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 00:48:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:48:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 00:48:15,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2023-11-12 00:48:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:48:15,546 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 00:48:15,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 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-12 00:48:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 00:48:15,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 00:48:15,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-11-12 00:48:15,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-11-12 00:48:15,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-11-12 00:48:15,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-11-12 00:48:15,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-11-12 00:48:15,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-11-12 00:48:15,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:48:15,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:48:15,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 00:48:19,095 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2023-11-12 00:48:19,095 INFO L899 garLoopResultBuilder]: For program point L564-2(lines 564 565) no Hoare annotation was computed. [2023-11-12 00:48:19,095 INFO L899 garLoopResultBuilder]: For program point L560(line 560) no Hoare annotation was computed. [2023-11-12 00:48:19,095 INFO L899 garLoopResultBuilder]: For program point L560-1(line 560) no Hoare annotation was computed. [2023-11-12 00:48:19,095 INFO L899 garLoopResultBuilder]: For program point L556(line 556) no Hoare annotation was computed. [2023-11-12 00:48:19,095 INFO L899 garLoopResultBuilder]: For program point L556-1(line 556) no Hoare annotation was computed. [2023-11-12 00:48:19,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 556) no Hoare annotation was computed. [2023-11-12 00:48:19,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 566) no Hoare annotation was computed. [2023-11-12 00:48:19,096 INFO L899 garLoopResultBuilder]: For program point L553-3(lines 553 563) no Hoare annotation was computed. [2023-11-12 00:48:19,096 INFO L899 garLoopResultBuilder]: For program point L553-5(lines 553 563) no Hoare annotation was computed. [2023-11-12 00:48:19,096 INFO L899 garLoopResultBuilder]: For program point test_fun_returnLabel#1(lines 547 567) no Hoare annotation was computed. [2023-11-12 00:48:19,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 556) no Hoare annotation was computed. [2023-11-12 00:48:19,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 00:48:19,096 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 566) no Hoare annotation was computed. [2023-11-12 00:48:19,096 INFO L899 garLoopResultBuilder]: For program point L566(line 566) no Hoare annotation was computed. [2023-11-12 00:48:19,097 INFO L899 garLoopResultBuilder]: For program point L566-1(line 566) no Hoare annotation was computed. [2023-11-12 00:48:19,097 INFO L899 garLoopResultBuilder]: For program point L554(lines 554 562) no Hoare annotation was computed. [2023-11-12 00:48:19,097 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 00:48:19,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2023-11-12 00:48:19,097 INFO L899 garLoopResultBuilder]: For program point L559-1(lines 559 561) no Hoare annotation was computed. [2023-11-12 00:48:19,097 INFO L895 garLoopResultBuilder]: At program point L559-3(lines 559 561) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (let ((.cse3 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse2 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (let ((.cse1 (select .cse3 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (<= 1 .cse0) (<= .cse1 2147483647) (<= 1 (+ .cse1 .cse0)) (<= .cse0 2147483647))) (let ((.cse5 (select .cse2 0)) (.cse4 (select .cse3 0))) (and (<= .cse4 2147483647) (<= 1 .cse5) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= .cse5 2147483647) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 (+ .cse4 2147483648)) (not |ULTIMATE.start_test_fun_#t~short6#1|)))))) [2023-11-12 00:48:19,097 INFO L895 garLoopResultBuilder]: At program point L559-4(lines 553 563) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (let ((.cse3 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse2 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (let ((.cse1 (select .cse3 0)) (.cse0 (select .cse2 0))) (and (<= .cse0 2147483647) (<= 0 (+ 2147483648 .cse1)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= .cse1 2147483647) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 (+ .cse0 2147483648)))) (let ((.cse4 (select .cse2 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse5 (select .cse3 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (<= .cse4 2147483647) (<= 0 (+ .cse4 .cse5 2147483648)) (<= .cse5 2147483647)))))) [2023-11-12 00:48:19,098 INFO L899 garLoopResultBuilder]: For program point L555-1(lines 555 557) no Hoare annotation was computed. [2023-11-12 00:48:19,098 INFO L895 garLoopResultBuilder]: At program point L555-3(lines 555 557) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 .cse0) (<= .cse0 2147483647) (<= .cse1 2147483647) (<= 0 .cse1))) [2023-11-12 00:48:19,100 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:48:19,103 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:48:19,122 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,123 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,124 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,124 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,125 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,126 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,126 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,126 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,127 ERROR L464 ceAbstractionStarter]: Failed to backtranslate (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= 1 .cse0) (<= .cse0 2147483647) (<= .cse1 2147483647) (<= 0 .cse1))) [2023-11-12 00:48:19,128 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,128 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,128 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,129 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,129 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,129 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,130 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,131 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,131 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,131 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short6 could not be translated [2023-11-12 00:48:19,138 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,138 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,138 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,139 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,139 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,139 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,139 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,139 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,140 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,140 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short6 could not be translated [2023-11-12 00:48:19,140 ERROR L464 ceAbstractionStarter]: Failed to backtranslate (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (let ((.cse3 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse2 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (let ((.cse1 (select .cse3 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (<= 1 .cse0) (<= .cse1 2147483647) (<= 1 (+ .cse1 .cse0)) (<= .cse0 2147483647))) (let ((.cse5 (select .cse2 0)) (.cse4 (select .cse3 0))) (and (<= .cse4 2147483647) (<= 1 .cse5) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= .cse5 2147483647) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 (+ .cse4 2147483648)) (not |ULTIMATE.start_test_fun_#t~short6#1|)))))) [2023-11-12 00:48:19,145 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,145 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,146 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,146 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,146 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,146 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,146 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,147 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,147 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,148 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,148 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,154 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,155 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,155 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,155 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,156 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,156 ERROR L464 ceAbstractionStarter]: Failed to backtranslate (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (let ((.cse3 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse2 (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (let ((.cse1 (select .cse3 0)) (.cse0 (select .cse2 0))) (and (<= .cse0 2147483647) (<= 0 (+ 2147483648 .cse1)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= .cse1 2147483647) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 (+ .cse0 2147483648)))) (let ((.cse4 (select .cse2 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse5 (select .cse3 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (<= .cse4 2147483647) (<= 0 (+ .cse4 .cse5 2147483648)) (<= .cse5 2147483647)))))) [2023-11-12 00:48:19,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:48:19 BoogieIcfgContainer [2023-11-12 00:48:19,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:48:19,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:48:19,157 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:48:19,158 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:48:19,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:47:41" (3/4) ... [2023-11-12 00:48:19,161 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 00:48:19,173 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-12 00:48:19,174 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-12 00:48:19,175 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-12 00:48:19,175 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 00:48:19,297 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:48:19,297 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/witness.yml [2023-11-12 00:48:19,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:48:19,298 INFO L158 Benchmark]: Toolchain (without parser) took 39302.43ms. Allocated memory was 163.6MB in the beginning and 522.2MB in the end (delta: 358.6MB). Free memory was 123.5MB in the beginning and 436.3MB in the end (delta: -312.8MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2023-11-12 00:48:19,299 INFO L158 Benchmark]: CDTParser took 1.21ms. Allocated memory is still 121.6MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:48:19,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.67ms. Allocated memory is still 163.6MB. Free memory was 123.5MB in the beginning and 107.3MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 00:48:19,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.54ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:48:19,300 INFO L158 Benchmark]: Boogie Preprocessor took 28.82ms. Allocated memory is still 163.6MB. Free memory was 105.2MB in the beginning and 104.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:48:19,301 INFO L158 Benchmark]: RCFGBuilder took 563.07ms. Allocated memory is still 163.6MB. Free memory was 104.1MB in the beginning and 134.0MB in the end (delta: -29.9MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2023-11-12 00:48:19,302 INFO L158 Benchmark]: TraceAbstraction took 38008.36ms. Allocated memory was 163.6MB in the beginning and 522.2MB in the end (delta: 358.6MB). Free memory was 133.2MB in the beginning and 440.5MB in the end (delta: -307.3MB). Peak memory consumption was 315.6MB. Max. memory is 16.1GB. [2023-11-12 00:48:19,302 INFO L158 Benchmark]: Witness Printer took 140.43ms. Allocated memory is still 522.2MB. Free memory was 440.5MB in the beginning and 436.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 00:48:19,305 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.21ms. Allocated memory is still 121.6MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 506.67ms. Allocated memory is still 163.6MB. Free memory was 123.5MB in the beginning and 107.3MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.54ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 105.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.82ms. Allocated memory is still 163.6MB. Free memory was 105.2MB in the beginning and 104.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 563.07ms. Allocated memory is still 163.6MB. Free memory was 104.1MB in the beginning and 134.0MB in the end (delta: -29.9MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 38008.36ms. Allocated memory was 163.6MB in the beginning and 522.2MB in the end (delta: 358.6MB). Free memory was 133.2MB in the beginning and 440.5MB in the end (delta: -307.3MB). Peak memory consumption was 315.6MB. Max. memory is 16.1GB. * Witness Printer took 140.43ms. Allocated memory is still 522.2MB. Free memory was 440.5MB in the beginning and 436.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 556]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 556]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 37.9s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 54 mSolverCounterUnknown, 471 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 471 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 68 IncrementalHoareTripleChecker+Unchecked, 419 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1116 IncrementalHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 117 mSDtfsCounter, 1116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 149 SyntacticMatches, 17 SemanticMatches, 209 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3043 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=10, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 78 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 25 NumberOfFragments, 187 HoareAnnotationTreeSize, 3 FomulaSimplifications, 9463 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 8224 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 281 ConstructedInterpolants, 57 QuantifiedInterpolants, 4552 SizeOfPredicates, 35 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 146/276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 555]: Loop Invariant [2023-11-12 00:48:19,322 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,323 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,323 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,323 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,324 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,324 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,324 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,325 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated Derived loop invariant: NULL - InvariantResult [Line: 559]: Loop Invariant [2023-11-12 00:48:19,326 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,326 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,326 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,327 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,327 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,327 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,327 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,327 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,328 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,328 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short6 could not be translated [2023-11-12 00:48:19,329 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,329 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,329 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,330 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,330 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,330 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,330 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,331 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,331 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,331 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short6 could not be translated Derived loop invariant: NULL - InvariantResult [Line: 553]: Loop Invariant [2023-11-12 00:48:19,332 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,332 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,333 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,333 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,333 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,333 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,334 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,334 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,335 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,335 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,335 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][0] could not be translated [2023-11-12 00:48:19,336 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][0] could not be translated [2023-11-12 00:48:19,336 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,336 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~y_ref~0!base][~y_ref~0!offset] could not be translated [2023-11-12 00:48:19,336 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated [2023-11-12 00:48:19,337 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~x_ref~0!base][~x_ref~0!offset] could not be translated Derived loop invariant: NULL RESULT: Ultimate proved your program to be correct! [2023-11-12 00:48:19,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddc14453-a816-4d2d-bb21-c09506d87236/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE