./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/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_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/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 32bit --witnessprinter.graph.data.programhash 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:52:22,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:52:22,821 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-12 00:52:22,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:52:22,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:52:22,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:52:22,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:52:22,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:52:22,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:52:22,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:52:22,857 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:52:22,858 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:52:22,859 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:52:22,860 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:52:22,861 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:52:22,862 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:52:22,865 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:52:22,865 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:52:22,866 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:52:22,867 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:52:22,871 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:52:22,872 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:52:22,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:52:22,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 00:52:22,873 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:52:22,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:52:22,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:52:22,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:52:22,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 00:52:22,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:52:22,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 00:52:22,876 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 00:52:22,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:52:22,877 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:52:22,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 00:52:22,877 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:52:22,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:52:22,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:52:22,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:52:22,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:52:22,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:52:22,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 00:52:22,879 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:52:22,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:52:22,879 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 00:52:22,880 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:52:22,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:52:22,880 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_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/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_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2023-11-12 00:52:23,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:52:23,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:52:23,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:52:23,152 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:52:23,152 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:52:23,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2023-11-12 00:52:26,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:52:26,547 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:52:26,548 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2023-11-12 00:52:26,555 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/data/c38ffd49b/5a5006b673aa49dfaf45fe11baa12d4e/FLAGdddf34d88 [2023-11-12 00:52:26,571 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/data/c38ffd49b/5a5006b673aa49dfaf45fe11baa12d4e [2023-11-12 00:52:26,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:52:26,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:52:26,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:52:26,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:52:26,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:52:26,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@530f73f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26, skipping insertion in model container [2023-11-12 00:52:26,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,608 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:52:26,769 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:52:26,782 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:52:26,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:52:26,820 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:52:26,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26 WrapperNode [2023-11-12 00:52:26,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:52:26,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:52:26,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:52:26,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:52:26,831 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:52:26" (1/1) ... [2023-11-12 00:52:26,839 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:52:26" (1/1) ... [2023-11-12 00:52:26,860 INFO L138 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2023-11-12 00:52:26,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:52:26,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:52:26,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:52:26,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:52:26,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:52:26,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:52:26,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:52:26,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:52:26,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (1/1) ... [2023-11-12 00:52:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:52:26,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:26,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/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:52:26,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/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:52:26,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:52:26,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 00:52:26,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 00:52:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:52:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure check [2023-11-12 00:52:26,998 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2023-11-12 00:52:26,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:52:27,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:52:27,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:52:27,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:52:27,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-12 00:52:27,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-12 00:52:27,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:52:27,091 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:52:27,093 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:52:27,275 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:52:27,346 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:52:27,350 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 00:52:27,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:52:27 BoogieIcfgContainer [2023-11-12 00:52:27,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:52:27,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:52:27,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:52:27,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:52:27,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:52:26" (1/3) ... [2023-11-12 00:52:27,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebf6963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:52:27, skipping insertion in model container [2023-11-12 00:52:27,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:52:26" (2/3) ... [2023-11-12 00:52:27,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebf6963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:52:27, skipping insertion in model container [2023-11-12 00:52:27,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:52:27" (3/3) ... [2023-11-12 00:52:27,365 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2023-11-12 00:52:27,380 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:52:27,381 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-12 00:52:27,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:52:27,430 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;@45bca6a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:52:27,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-12 00:52:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-12 00:52:27,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 00:52:27,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:27,441 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:27,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:52:27,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:27,446 INFO L85 PathProgramCache]: Analyzing trace with hash 153663891, now seen corresponding path program 1 times [2023-11-12 00:52:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:27,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34737412] [2023-11-12 00:52:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:27,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:52:27,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34737412] [2023-11-12 00:52:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34737412] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:27,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284427419] [2023-11-12 00:52:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:27,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:27,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:27,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:27,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:52:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:28,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:52:28,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:52:28,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 00:52:28,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284427419] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [584040239] [2023-11-12 00:52:28,233 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2023-11-12 00:52:28,233 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:52:28,237 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:52:28,247 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:52:28,248 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:52:28,856 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 73 for LOIs [2023-11-12 00:52:28,959 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:52:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [584040239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:29,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:52:29,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 11 [2023-11-12 00:52:29,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717373456] [2023-11-12 00:52:29,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:29,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 00:52:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 00:52:29,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:52:29,753 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 9 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:52:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:29,995 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-11-12 00:52:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:52:29,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 10 [2023-11-12 00:52:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:30,006 INFO L225 Difference]: With dead ends: 40 [2023-11-12 00:52:30,007 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:52:30,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-12 00:52:30,017 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:30,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 124 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:52:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:52:30,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-12 00:52:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-12 00:52:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-11-12 00:52:30,063 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10 [2023-11-12 00:52:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:30,065 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-11-12 00:52:30,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 00:52:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-11-12 00:52:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:52:30,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:30,067 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:30,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-12 00:52:30,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:30,273 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:52:30,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash -761978094, now seen corresponding path program 1 times [2023-11-12 00:52:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648810988] [2023-11-12 00:52:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:52:30,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:30,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648810988] [2023-11-12 00:52:30,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648810988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:30,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:30,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:52:30,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443257364] [2023-11-12 00:52:30,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:30,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:52:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:30,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:52:30,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:52:30,488 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:52:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:30,576 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2023-11-12 00:52:30,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:52:30,576 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2023-11-12 00:52:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:30,578 INFO L225 Difference]: With dead ends: 45 [2023-11-12 00:52:30,578 INFO L226 Difference]: Without dead ends: 43 [2023-11-12 00:52:30,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:52:30,580 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:30,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 81 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:52:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-12 00:52:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2023-11-12 00:52:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:52:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2023-11-12 00:52:30,599 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 23 [2023-11-12 00:52:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:30,600 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2023-11-12 00:52:30,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:52:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2023-11-12 00:52:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 00:52:30,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:30,601 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:30,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:52:30,602 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:52:30,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash -761977902, now seen corresponding path program 1 times [2023-11-12 00:52:30,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:30,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709845791] [2023-11-12 00:52:30,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:52:30,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709845791] [2023-11-12 00:52:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709845791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:30,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:30,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:52:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644139119] [2023-11-12 00:52:30,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:30,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:52:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:30,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:52:30,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:52:30,856 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:52:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:30,961 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2023-11-12 00:52:30,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:52:30,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 23 [2023-11-12 00:52:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:30,963 INFO L225 Difference]: With dead ends: 68 [2023-11-12 00:52:30,963 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 00:52:30,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:52:30,965 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:30,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 91 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:52:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 00:52:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-11-12 00:52:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:52:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-11-12 00:52:30,985 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 23 [2023-11-12 00:52:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:30,985 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-12 00:52:30,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:52:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-11-12 00:52:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-12 00:52:30,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:30,988 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:30,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:52:30,989 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:52:30,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash -297120247, now seen corresponding path program 1 times [2023-11-12 00:52:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:30,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134809413] [2023-11-12 00:52:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:30,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:52:31,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:31,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134809413] [2023-11-12 00:52:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134809413] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764518609] [2023-11-12 00:52:31,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:31,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:31,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:31,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:31,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:52:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:31,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 00:52:31,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:52:31,396 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:52:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764518609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:52:31,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2023-11-12 00:52:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930417888] [2023-11-12 00:52:31,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:31,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:52:31,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:52:31,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:52:31,403 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-12 00:52:31,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:31,547 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-12 00:52:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 00:52:31,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 36 [2023-11-12 00:52:31,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:31,550 INFO L225 Difference]: With dead ends: 38 [2023-11-12 00:52:31,550 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 00:52:31,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-11-12 00:52:31,553 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:31,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 111 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:52:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 00:52:31,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2023-11-12 00:52:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:52:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-12 00:52:31,573 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 36 [2023-11-12 00:52:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:31,573 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-12 00:52:31,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-12 00:52:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-12 00:52:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-12 00:52:31,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:31,576 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:31,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:31,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:31,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:52:31,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:31,783 INFO L85 PathProgramCache]: Analyzing trace with hash -297120055, now seen corresponding path program 1 times [2023-11-12 00:52:31,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:31,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297359737] [2023-11-12 00:52:31,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:31,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:52:31,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:31,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297359737] [2023-11-12 00:52:31,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297359737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:31,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359971675] [2023-11-12 00:52:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:31,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:31,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:31,971 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:31,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:52:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:32,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-12 00:52:32,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:52:32,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:52:32,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359971675] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:32,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1677658769] [2023-11-12 00:52:32,355 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-11-12 00:52:32,355 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:52:32,357 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:52:32,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:52:32,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-11-12 00:52:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996993407] [2023-11-12 00:52:32,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:52:32,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-12 00:52:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:32,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-12 00:52:32,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2023-11-12 00:52:32,373 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 16 states have internal predecessors, (40), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-11-12 00:52:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:32,688 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-12 00:52:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 00:52:32,689 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 16 states have internal predecessors, (40), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 36 [2023-11-12 00:52:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:32,690 INFO L225 Difference]: With dead ends: 38 [2023-11-12 00:52:32,690 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 00:52:32,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2023-11-12 00:52:32,692 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 75 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:32,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 160 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:52:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 00:52:32,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-11-12 00:52:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 00:52:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-12 00:52:32,700 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 36 [2023-11-12 00:52:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:32,701 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-12 00:52:32,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 16 states have internal predecessors, (40), 9 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2023-11-12 00:52:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-12 00:52:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-12 00:52:32,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:32,702 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:32,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:32,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:32,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:52:32,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash -620792993, now seen corresponding path program 1 times [2023-11-12 00:52:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:32,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176790131] [2023-11-12 00:52:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:52:33,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176790131] [2023-11-12 00:52:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176790131] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81397885] [2023-11-12 00:52:33,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:33,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:33,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:33,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:33,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:52:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:33,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 00:52:33,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:52:33,210 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:52:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81397885] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:33,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [657337780] [2023-11-12 00:52:33,319 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-12 00:52:33,319 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:52:33,319 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:52:33,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:52:33,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-11-12 00:52:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276116487] [2023-11-12 00:52:33,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:52:33,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-12 00:52:33,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:33,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 00:52:33,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-11-12 00:52:33,324 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-12 00:52:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:33,566 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2023-11-12 00:52:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 00:52:33,566 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 37 [2023-11-12 00:52:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:33,570 INFO L225 Difference]: With dead ends: 76 [2023-11-12 00:52:33,570 INFO L226 Difference]: Without dead ends: 75 [2023-11-12 00:52:33,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2023-11-12 00:52:33,572 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:33,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 112 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:52:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-12 00:52:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2023-11-12 00:52:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 17 states have call successors, (17), 8 states have call predecessors, (17), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 00:52:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2023-11-12 00:52:33,589 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 37 [2023-11-12 00:52:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:33,590 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2023-11-12 00:52:33,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-12 00:52:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2023-11-12 00:52:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-12 00:52:33,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:33,591 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:33,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:33,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-12 00:52:33,798 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:52:33,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash -620787035, now seen corresponding path program 1 times [2023-11-12 00:52:33,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:33,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617367053] [2023-11-12 00:52:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-12 00:52:33,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617367053] [2023-11-12 00:52:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617367053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:52:33,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:52:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:52:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752046686] [2023-11-12 00:52:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:52:33,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:52:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:33,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:52:33,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:52:33,891 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:52:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:33,946 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2023-11-12 00:52:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:52:33,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-11-12 00:52:33,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:33,948 INFO L225 Difference]: With dead ends: 68 [2023-11-12 00:52:33,948 INFO L226 Difference]: Without dead ends: 67 [2023-11-12 00:52:33,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:52:33,949 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:33,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:52:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-12 00:52:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2023-11-12 00:52:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 17 states have call successors, (17), 8 states have call predecessors, (17), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-12 00:52:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2023-11-12 00:52:33,963 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 37 [2023-11-12 00:52:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:33,963 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2023-11-12 00:52:33,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-12 00:52:33,964 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2023-11-12 00:52:33,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-12 00:52:33,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:33,966 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:33,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:52:33,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:52:33,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:33,967 INFO L85 PathProgramCache]: Analyzing trace with hash -529400650, now seen corresponding path program 2 times [2023-11-12 00:52:33,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:33,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004079143] [2023-11-12 00:52:33,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:33,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-12 00:52:34,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:34,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004079143] [2023-11-12 00:52:34,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004079143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:34,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302121577] [2023-11-12 00:52:34,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:52:34,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:34,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:34,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:34,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:52:34,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-12 00:52:34,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:52:34,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-12 00:52:34,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-12 00:52:34,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-12 00:52:35,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302121577] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1348528163] [2023-11-12 00:52:35,049 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-12 00:52:35,049 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:52:35,050 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:52:35,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:52:35,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2023-11-12 00:52:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812501113] [2023-11-12 00:52:35,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:52:35,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-12 00:52:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-12 00:52:35,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2023-11-12 00:52:35,054 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 24 states have internal predecessors, (73), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2023-11-12 00:52:35,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:35,855 INFO L93 Difference]: Finished difference Result 144 states and 180 transitions. [2023-11-12 00:52:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-12 00:52:35,856 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 24 states have internal predecessors, (73), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) Word has length 76 [2023-11-12 00:52:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:35,859 INFO L225 Difference]: With dead ends: 144 [2023-11-12 00:52:35,859 INFO L226 Difference]: Without dead ends: 143 [2023-11-12 00:52:35,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=986, Invalid=3046, Unknown=0, NotChecked=0, Total=4032 [2023-11-12 00:52:35,861 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 268 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:35,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 217 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:52:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-12 00:52:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2023-11-12 00:52:35,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 94 states have internal predecessors, (105), 35 states have call successors, (35), 14 states have call predecessors, (35), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-12 00:52:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2023-11-12 00:52:35,883 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 76 [2023-11-12 00:52:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:35,883 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2023-11-12 00:52:35,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 24 states have internal predecessors, (73), 12 states have call successors, (35), 12 states have call predecessors, (35), 1 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2023-11-12 00:52:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2023-11-12 00:52:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-12 00:52:35,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:52:35,887 INFO L195 NwaCegarLoop]: trace histogram [13, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:35,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:36,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:36,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-12 00:52:36,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:52:36,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1975508118, now seen corresponding path program 3 times [2023-11-12 00:52:36,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:52:36,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036842642] [2023-11-12 00:52:36,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:52:36,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:52:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:52:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 485 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2023-11-12 00:52:37,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:52:37,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036842642] [2023-11-12 00:52:37,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036842642] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:52:37,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958004838] [2023-11-12 00:52:37,846 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 00:52:37,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:37,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:52:37,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:52:37,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-12 00:52:38,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 00:52:38,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:52:38,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-12 00:52:38,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:52:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2023-11-12 00:52:38,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:52:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2023-11-12 00:52:38,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958004838] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:52:38,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1812680942] [2023-11-12 00:52:38,782 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-12 00:52:38,782 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:52:38,782 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-12 00:52:38,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:52:38,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 6, 6] total 44 [2023-11-12 00:52:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535408662] [2023-11-12 00:52:38,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:52:38,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-12 00:52:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:52:38,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-12 00:52:38,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2023-11-12 00:52:38,788 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 45 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 32 states have internal predecessors, (105), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2023-11-12 00:52:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:52:42,647 INFO L93 Difference]: Finished difference Result 288 states and 358 transitions. [2023-11-12 00:52:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2023-11-12 00:52:42,648 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 32 states have internal predecessors, (105), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 154 [2023-11-12 00:52:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:52:42,650 INFO L225 Difference]: With dead ends: 288 [2023-11-12 00:52:42,650 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 00:52:42,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6732 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4763, Invalid=16699, Unknown=0, NotChecked=0, Total=21462 [2023-11-12 00:52:42,664 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 934 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:52:42,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 193 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 00:52:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 00:52:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 00:52:42,666 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:52:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 00:52:42,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2023-11-12 00:52:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:52:42,666 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 00:52:42,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 32 states have internal predecessors, (105), 18 states have call successors, (51), 14 states have call predecessors, (51), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2023-11-12 00:52:42,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 00:52:42,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 00:52:42,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2023-11-12 00:52:42,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2023-11-12 00:52:42,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2023-11-12 00:52:42,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2023-11-12 00:52:42,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2023-11-12 00:52:42,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2023-11-12 00:52:42,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-12 00:52:42,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:52:42,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 00:52:47,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-11-12 00:52:47,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 00:52:47,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-11-12 00:52:47,297 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_#length_11| (Array Int Int))) (and (= |#length| (store |v_#length_11| |ULTIMATE.start_main_#t~malloc14#1.base| (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4))) (= (select |v_#length_11| 3) 12) (= (select |v_#length_11| 2) 31) (= 2 (select |v_#length_11| 1)))) (<= (+ |ULTIMATE.start_main_#t~malloc14#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_#t~malloc14#1.base| |ULTIMATE.start_main_~a~0#1.base|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (not (= |ULTIMATE.start_main_#t~malloc14#1.base| 0)) (<= |ULTIMATE.start_main_~n~0#1| 1073741823) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0) (exists ((|v_#valid_21| (Array Int Int))) (and (= (select |v_#valid_21| 1) 1) (= (select |v_#valid_21| 0) 0) (= (select |v_#valid_21| 2) 1) (= (select |v_#valid_21| |ULTIMATE.start_main_#t~malloc14#1.base|) 0) (= (store |v_#valid_21| |ULTIMATE.start_main_#t~malloc14#1.base| 1) |#valid|) (= (select |v_#valid_21| 3) 1))) (exists ((|v_#memory_int_14| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_14| 1))) (and (= |#memory_int| (store |v_#memory_int_14| |ULTIMATE.start_main_#t~malloc14#1.base| ((as const (Array Int Int)) 0))) (= 48 (select .cse0 0)) (= (select .cse0 1) 0))))) [2023-11-12 00:52:47,297 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2023-11-12 00:52:47,297 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-12 00:52:47,297 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-11-12 00:52:47,297 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~i~0#1| 2147483647) (= 31 (select |#length| 2)) (= 2 (select |#length| 1)) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (= (select |#valid| 3) 1) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (<= 0 |ULTIMATE.start_main_~n~0#1|) (= (select .cse0 1) 0))) [2023-11-12 00:52:47,298 INFO L895 garLoopResultBuilder]: At program point L47-2(line 47) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_#length_11| (Array Int Int))) (and (= |#length| (store |v_#length_11| |ULTIMATE.start_main_#t~malloc14#1.base| (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4))) (= (select |v_#length_11| 3) 12) (= (select |v_#length_11| 2) 31) (= 2 (select |v_#length_11| 1)))) (<= (+ |ULTIMATE.start_main_#t~malloc14#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_#t~malloc14#1.base| |ULTIMATE.start_main_~a~0#1.base|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (not (= |ULTIMATE.start_main_#t~malloc14#1.base| 0)) (<= |ULTIMATE.start_main_~n~0#1| 1073741823) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0) (exists ((|v_#valid_21| (Array Int Int))) (and (= (select |v_#valid_21| 1) 1) (= (select |v_#valid_21| 0) 0) (= (select |v_#valid_21| 2) 1) (= (select |v_#valid_21| |ULTIMATE.start_main_#t~malloc14#1.base|) 0) (= (store |v_#valid_21| |ULTIMATE.start_main_#t~malloc14#1.base| 1) |#valid|) (= (select |v_#valid_21| 3) 1))) (exists ((|v_#memory_int_14| (Array Int (Array Int Int)))) (let ((.cse0 (select |v_#memory_int_14| 1))) (and (= |#memory_int| (store |v_#memory_int_14| |ULTIMATE.start_main_#t~malloc14#1.base| ((as const (Array Int Int)) 0))) (= 48 (select .cse0 0)) (= (select .cse0 1) 0))))) [2023-11-12 00:52:47,298 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-11-12 00:52:47,298 INFO L899 garLoopResultBuilder]: For program point L47-3(line 47) no Hoare annotation was computed. [2023-11-12 00:52:47,298 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= (select |#length| 3) 12) (<= 1 |#StackHeapBarrier|) (= 31 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))) [2023-11-12 00:52:47,298 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 00:52:47,299 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2023-11-12 00:52:47,299 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-11-12 00:52:47,299 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-11-12 00:52:47,299 INFO L899 garLoopResultBuilder]: For program point checkErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-11-12 00:52:47,299 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-11-12 00:52:47,299 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2023-11-12 00:52:47,299 INFO L899 garLoopResultBuilder]: For program point checkErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2023-11-12 00:52:47,299 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-11-12 00:52:47,299 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2023-11-12 00:52:47,299 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-11-12 00:52:47,300 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 38) the Hoare annotation is: true [2023-11-12 00:52:47,300 INFO L899 garLoopResultBuilder]: For program point checkFINAL(lines 16 38) no Hoare annotation was computed. [2023-11-12 00:52:47,300 INFO L899 garLoopResultBuilder]: For program point checkErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 27) no Hoare annotation was computed. [2023-11-12 00:52:47,300 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 27) no Hoare annotation was computed. [2023-11-12 00:52:47,300 INFO L899 garLoopResultBuilder]: For program point checkErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-11-12 00:52:47,300 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-11-12 00:52:47,300 INFO L899 garLoopResultBuilder]: For program point L26-2(line 26) no Hoare annotation was computed. [2023-11-12 00:52:47,301 INFO L895 garLoopResultBuilder]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse3 (<= 1 check_~y)) (.cse4 (<= check_~y 2147483646)) (.cse0 (< |check_#in~x| 1)) (.cse1 (< |check_#in~y| 1)) (.cse2 (< 2147483646 |check_#in~y|))) (and (or .cse0 .cse1 (<= check_~x 8) .cse2 (< 7 |check_#in~x|)) (or .cse0 .cse1 .cse2 (< 6 |check_#in~x|) (<= check_~x 7)) (or .cse0 .cse1 .cse2 (< 5 |check_#in~x|) (<= check_~x 6)) (or .cse0 .cse1 (<= check_~x 9) .cse2 (< 8 |check_#in~x|)) (or .cse0 .cse1 (<= check_~x 2) .cse2 (< 1 |check_#in~x|)) (or .cse0 (< 9 |check_#in~x|) .cse1 .cse2 (<= check_~x 10)) (or .cse0 .cse1 .cse2 (<= check_~x 4) (< 3 |check_#in~x|)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (< 2 |check_#in~x|)) (or .cse0 .cse1 (<= check_~x 2147483645) .cse2 (< 10 |check_#in~x|)) (or .cse0 (< 4 |check_#in~x|) .cse1 .cse2 (<= check_~x 5)) (or (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))) (not (= |check_#in~x| 0)) .cse2 (and (= check_~x 1) .cse3 .cse4)) (or .cse0 .cse1 .cse2 (and .cse3 (<= 1 check_~x) .cse4)) (or .cse0 .cse1 .cse2 (<= check_~x 2147483646)))) [2023-11-12 00:52:47,301 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (let ((.cse3 (<= check_~y 2147483646)) (.cse0 (< |check_#in~x| 1)) (.cse1 (< |check_#in~y| 1)) (.cse2 (< 2147483646 |check_#in~y|))) (and (or .cse0 .cse1 (<= check_~x 2147483645) .cse2) (or .cse0 .cse1 .cse2 (and (<= 2 check_~y) (<= 1 check_~x) .cse3)) (or .cse0 .cse1 (= check_~x 1) .cse2 (< 1 |check_#in~x|)) (or .cse0 .cse1 .cse2 (<= check_~x 10) (< 10 |check_#in~x|)) (or .cse0 .cse1 .cse2 (< 6 |check_#in~x|) (<= check_~x 6)) (or .cse0 .cse1 (<= check_~x 2) .cse2 (< 2 |check_#in~x|)) (or (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))) (let ((.cse4 (select |#memory_int| check_~a.base))) (and (= check_~x 0) (= (select .cse4 (+ (* 4 check_~y) check_~a.offset)) 0) (<= 1 check_~y) .cse3 (= (select .cse4 check_~a.offset) 0))) (not (= |check_#in~x| 0)) .cse2) (or .cse0 (< 4 |check_#in~x|) .cse1 .cse2 (<= check_~x 4)) (or .cse0 .cse1 (<= check_~x 8) .cse2 (< 8 |check_#in~x|)) (or .cse0 (< 9 |check_#in~x|) .cse1 (<= check_~x 9) .cse2) (or .cse0 .cse1 .cse2 (< 7 |check_#in~x|) (<= check_~x 7)) (or .cse0 .cse1 .cse2 (<= check_~x 5) (< 5 |check_#in~x|)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (< 3 |check_#in~x|)))) [2023-11-12 00:52:47,301 INFO L895 garLoopResultBuilder]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse3 (<= check_~y 2147483646)) (.cse0 (< |check_#in~x| 1)) (.cse1 (< |check_#in~y| 1)) (.cse2 (< 2147483646 |check_#in~y|))) (and (or .cse0 .cse1 (<= check_~x 2147483645) .cse2) (or .cse0 .cse1 .cse2 (and (<= 2 check_~y) (<= 1 check_~x) .cse3)) (or .cse0 .cse1 (= check_~x 1) .cse2 (< 1 |check_#in~x|)) (or .cse0 .cse1 .cse2 (<= check_~x 10) (< 10 |check_#in~x|)) (or .cse0 .cse1 .cse2 (< 6 |check_#in~x|) (<= check_~x 6)) (or .cse0 .cse1 (<= check_~x 2) .cse2 (< 2 |check_#in~x|)) (or (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))) (let ((.cse4 (select |#memory_int| check_~a.base))) (and (= check_~x 0) (= (select .cse4 (+ (* 4 check_~y) check_~a.offset)) 0) (<= 1 check_~y) .cse3 (= (select .cse4 check_~a.offset) 0))) (not (= |check_#in~x| 0)) .cse2) (or .cse0 (< 4 |check_#in~x|) .cse1 .cse2 (<= check_~x 4)) (or .cse0 .cse1 (<= check_~x 8) .cse2 (< 8 |check_#in~x|)) (or .cse0 (< 9 |check_#in~x|) .cse1 (<= check_~x 9) .cse2) (or .cse0 .cse1 .cse2 (< 7 |check_#in~x|) (<= check_~x 7)) (or .cse0 .cse1 .cse2 (<= check_~x 5) (< 5 |check_#in~x|)) (or .cse0 .cse1 (<= check_~x 3) .cse2 (< 3 |check_#in~x|)))) [2023-11-12 00:52:47,301 INFO L899 garLoopResultBuilder]: For program point checkEXIT(lines 16 38) no Hoare annotation was computed. [2023-11-12 00:52:47,302 INFO L902 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2023-11-12 00:52:47,302 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2023-11-12 00:52:47,302 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 12) no Hoare annotation was computed. [2023-11-12 00:52:47,302 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 12) the Hoare annotation is: true [2023-11-12 00:52:47,305 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-11-12 00:52:47,307 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:52:47,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:52:47 BoogieIcfgContainer [2023-11-12 00:52:47,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:52:47,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:52:47,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:52:47,313 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:52:47,313 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:52:27" (3/4) ... [2023-11-12 00:52:47,315 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 00:52:47,319 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-12 00:52:47,319 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2023-11-12 00:52:47,319 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-12 00:52:47,325 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2023-11-12 00:52:47,325 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-12 00:52:47,325 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 00:52:47,325 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 00:52:47,405 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/witness.graphml [2023-11-12 00:52:47,406 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/witness.yml [2023-11-12 00:52:47,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:52:47,406 INFO L158 Benchmark]: Toolchain (without parser) took 20830.70ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 144.6MB in the beginning and 340.9MB in the end (delta: -196.3MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2023-11-12 00:52:47,407 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory was 66.8MB in the beginning and 66.7MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:52:47,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.23ms. Allocated memory is still 182.5MB. Free memory was 144.6MB in the beginning and 134.0MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 00:52:47,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.16ms. Allocated memory is still 182.5MB. Free memory was 133.6MB in the beginning and 132.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:52:47,408 INFO L158 Benchmark]: Boogie Preprocessor took 44.66ms. Allocated memory is still 182.5MB. Free memory was 132.1MB in the beginning and 130.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:52:47,409 INFO L158 Benchmark]: RCFGBuilder took 448.04ms. Allocated memory is still 182.5MB. Free memory was 130.7MB in the beginning and 115.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 00:52:47,409 INFO L158 Benchmark]: TraceAbstraction took 19953.64ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 115.1MB in the beginning and 346.1MB in the end (delta: -231.0MB). Peak memory consumption was 193.6MB. Max. memory is 16.1GB. [2023-11-12 00:52:47,409 INFO L158 Benchmark]: Witness Printer took 93.06ms. Allocated memory is still 383.8MB. Free memory was 346.1MB in the beginning and 340.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 00:52:47,411 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory was 66.8MB in the beginning and 66.7MB in the end (delta: 159.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.23ms. Allocated memory is still 182.5MB. Free memory was 144.6MB in the beginning and 134.0MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.16ms. Allocated memory is still 182.5MB. Free memory was 133.6MB in the beginning and 132.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.66ms. Allocated memory is still 182.5MB. Free memory was 132.1MB in the beginning and 130.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 448.04ms. Allocated memory is still 182.5MB. Free memory was 130.7MB in the beginning and 115.7MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19953.64ms. Allocated memory was 182.5MB in the beginning and 383.8MB in the end (delta: 201.3MB). Free memory was 115.1MB in the beginning and 346.1MB in the end (delta: -231.0MB). Peak memory consumption was 193.6MB. Max. memory is 16.1GB. * Witness Printer took 93.06ms. Allocated memory is still 383.8MB. Free memory was 346.1MB in the beginning and 340.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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 4 procedures, 38 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1471 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1469 mSDsluCounter, 1144 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 965 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1262 IncrementalHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 179 mSDtfsCounter, 1262 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 931 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8177 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=8, InterpolantAutomatonStates: 212, 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, 9 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 298 PreInvPairs, 344 NumberOfFragments, 1057 HoareAnnotationTreeSize, 298 FomulaSimplifications, 28739 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 11 FomulaSimplificationsInter, 5633 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 2481 SizeOfPredicates, 39 NumberOfNonLiveVariables, 1641 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 1992/2903 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: OVERALL_TIME: 0.7s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 9, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 6, TOOLS_POST_TIME: 0.2s, TOOLS_POST_CALL_APPLICATIONS: 6, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 4, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 16, TOOLS_QUANTIFIERELIM_TIME: 0.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 25, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 9, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 4, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 64, DAG_COMPRESSION_RETAINED_NODES: 28, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-12 00:52:47,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f24b3e1-c0fd-40cf-9b03-0797c5067edb/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE