./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 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_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 00:28:52,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:28:52,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:28:52,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:28:52,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:28:52,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:28:52,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:28:52,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:28:52,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:28:52,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:28:52,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:28:52,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:28:52,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:28:52,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:28:52,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:28:52,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:28:52,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:28:52,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:28:52,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:28:52,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:28:52,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:28:52,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:28:52,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:28:52,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:28:52,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:28:52,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:28:52,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:28:52,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:28:52,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:28:52,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:28:52,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:28:52,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:28:52,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:28:52,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:28:52,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:28:52,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:28:52,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:28:52,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:28:52,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:28:52,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:28:52,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:28:52,591 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-22 00:28:52,626 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:28:52,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:28:52,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:28:52,627 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:28:52,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:28:52,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:28:52,628 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:28:52,628 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:28:52,628 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:28:52,628 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:28:52,628 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:28:52,629 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:28:52,629 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:28:52,629 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:28:52,629 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:28:52,630 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:28:52,630 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:28:52,630 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:28:52,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:28:52,631 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:28:52,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:28:52,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:28:52,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:28:52,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:28:52,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:28:52,632 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 00:28:52,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:28:52,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:28:52,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:28:52,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:28:52,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:28:52,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:28:52,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:28:52,634 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:28:52,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:28:52,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:28:52,634 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:28:52,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:28:52,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:28:52,635 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:28:52,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/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_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 [2022-11-22 00:28:52,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:28:52,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:28:52,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:28:52,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:28:52,983 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:28:52,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2022-11-22 00:28:56,115 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:28:56,353 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:28:56,354 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2022-11-22 00:28:56,365 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/data/26dabdeab/71b53f8c17564b48b8e3af9591a1346b/FLAG36049afa2 [2022-11-22 00:28:56,382 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/data/26dabdeab/71b53f8c17564b48b8e3af9591a1346b [2022-11-22 00:28:56,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:28:56,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:28:56,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:28:56,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:28:56,393 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:28:56,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183e5dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56, skipping insertion in model container [2022-11-22 00:28:56,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:28:56,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:28:56,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:28:56,729 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:28:56,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:28:56,826 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:28:56,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56 WrapperNode [2022-11-22 00:28:56,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:28:56,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:28:56,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:28:56,829 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:28:56,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,892 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92 [2022-11-22 00:28:56,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:28:56,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:28:56,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:28:56,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:28:56,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,938 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:28:56,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:28:56,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:28:56,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:28:56,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (1/1) ... [2022-11-22 00:28:56,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:28:56,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:28:56,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:28:57,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:28:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:28:57,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:28:57,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:28:57,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:28:57,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:28:57,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:28:57,176 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:28:57,178 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:28:57,368 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:28:57,415 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:28:57,416 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-22 00:28:57,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:28:57 BoogieIcfgContainer [2022-11-22 00:28:57,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:28:57,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:28:57,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:28:57,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:28:57,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:28:56" (1/3) ... [2022-11-22 00:28:57,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7a4969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:28:57, skipping insertion in model container [2022-11-22 00:28:57,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:28:56" (2/3) ... [2022-11-22 00:28:57,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7a4969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:28:57, skipping insertion in model container [2022-11-22 00:28:57,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:28:57" (3/3) ... [2022-11-22 00:28:57,428 INFO L112 eAbstractionObserver]: Analyzing ICFG b.15-alloca.i [2022-11-22 00:28:57,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:28:57,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-22 00:28:57,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:28:57,505 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7cb6c978, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:28:57,505 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-22 00:28:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.8) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 00:28:57,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:57,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 00:28:57,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 00:28:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1925576693, now seen corresponding path program 1 times [2022-11-22 00:28:57,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:57,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803881393] [2022-11-22 00:28:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:59,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:28:59,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803881393] [2022-11-22 00:28:59,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803881393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:28:59,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:28:59,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:28:59,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407796966] [2022-11-22 00:28:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:28:59,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:28:59,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:28:59,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:28:59,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:28:59,312 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.8) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:28:59,508 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-11-22 00:28:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:28:59,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 00:28:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:28:59,518 INFO L225 Difference]: With dead ends: 46 [2022-11-22 00:28:59,519 INFO L226 Difference]: Without dead ends: 26 [2022-11-22 00:28:59,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:28:59,527 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:28:59,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 29 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:28:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-22 00:28:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2022-11-22 00:28:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-22 00:28:59,573 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 6 [2022-11-22 00:28:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:28:59,574 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-22 00:28:59,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-22 00:28:59,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 00:28:59,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:59,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:28:59,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:28:59,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 00:28:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash 436664723, now seen corresponding path program 1 times [2022-11-22 00:28:59,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:59,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704491273] [2022-11-22 00:28:59,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:59,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:00,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:29:00,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704491273] [2022-11-22 00:29:00,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704491273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:29:00,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:29:00,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:29:00,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000938646] [2022-11-22 00:29:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:29:00,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:29:00,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:29:00,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:29:00,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:29:00,190 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:00,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:29:00,288 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-11-22 00:29:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:29:00,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 00:29:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:29:00,290 INFO L225 Difference]: With dead ends: 28 [2022-11-22 00:29:00,290 INFO L226 Difference]: Without dead ends: 27 [2022-11-22 00:29:00,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:29:00,292 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:29:00,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 23 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:29:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-22 00:29:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-11-22 00:29:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-22 00:29:00,299 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 7 [2022-11-22 00:29:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:29:00,300 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-22 00:29:00,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-22 00:29:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 00:29:00,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:29:00,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:29:00,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:29:00,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 00:29:00,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:29:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash 651704589, now seen corresponding path program 1 times [2022-11-22 00:29:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:29:00,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007407842] [2022-11-22 00:29:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:00,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:29:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:00,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:29:00,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007407842] [2022-11-22 00:29:00,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007407842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:29:00,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:29:00,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 00:29:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789926966] [2022-11-22 00:29:00,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:29:00,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 00:29:00,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:29:00,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 00:29:00,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:29:00,561 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:29:00,683 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-11-22 00:29:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 00:29:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 00:29:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:29:00,685 INFO L225 Difference]: With dead ends: 29 [2022-11-22 00:29:00,685 INFO L226 Difference]: Without dead ends: 28 [2022-11-22 00:29:00,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-22 00:29:00,686 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:29:00,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 20 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:29:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-22 00:29:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2022-11-22 00:29:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-22 00:29:00,693 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2022-11-22 00:29:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:29:00,694 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-22 00:29:00,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-22 00:29:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 00:29:00,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:29:00,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:29:00,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:29:00,696 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 00:29:00,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:29:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1271994155, now seen corresponding path program 1 times [2022-11-22 00:29:00,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:29:00,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885824145] [2022-11-22 00:29:00,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:29:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:00,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:29:00,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885824145] [2022-11-22 00:29:00,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885824145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:29:00,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:29:00,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:29:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918328526] [2022-11-22 00:29:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:29:00,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:29:00,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:29:00,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:29:00,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:29:00,932 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:29:01,018 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-11-22 00:29:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:29:01,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 00:29:01,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:29:01,019 INFO L225 Difference]: With dead ends: 30 [2022-11-22 00:29:01,019 INFO L226 Difference]: Without dead ends: 29 [2022-11-22 00:29:01,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-22 00:29:01,021 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:29:01,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 26 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:29:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-22 00:29:01,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-11-22 00:29:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.4) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-22 00:29:01,027 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2022-11-22 00:29:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:29:01,028 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-22 00:29:01,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-22 00:29:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 00:29:01,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:29:01,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:29:01,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:29:01,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 00:29:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:29:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash 518633794, now seen corresponding path program 1 times [2022-11-22 00:29:01,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:29:01,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128199572] [2022-11-22 00:29:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:01,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:29:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:01,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:29:01,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128199572] [2022-11-22 00:29:01,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128199572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:29:01,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325229253] [2022-11-22 00:29:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:01,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:29:01,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:29:01,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:29:01,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:29:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:01,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-22 00:29:01,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:29:01,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 00:29:01,577 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-22 00:29:01,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-22 00:29:01,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 00:29:01,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:01,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:29:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:01,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325229253] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 00:29:01,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 00:29:01,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 15 [2022-11-22 00:29:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219743993] [2022-11-22 00:29:01,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:29:01,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:29:01,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:29:01,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:29:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-11-22 00:29:01,836 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-11-22 00:29:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:29:01,893 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-11-22 00:29:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:29:01,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 00:29:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:29:01,895 INFO L225 Difference]: With dead ends: 24 [2022-11-22 00:29:01,895 INFO L226 Difference]: Without dead ends: 23 [2022-11-22 00:29:01,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-22 00:29:01,896 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:29:01,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 00:29:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-22 00:29:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2022-11-22 00:29:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-11-22 00:29:01,900 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-11-22 00:29:01,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:29:01,901 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-11-22 00:29:01,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2022-11-22 00:29:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-11-22 00:29:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:29:01,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:29:01,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:29:01,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 00:29:02,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:29:02,113 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 00:29:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:29:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1102221508, now seen corresponding path program 1 times [2022-11-22 00:29:02,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:29:02,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136757769] [2022-11-22 00:29:02,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:02,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:29:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:03,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:29:03,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136757769] [2022-11-22 00:29:03,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136757769] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:29:03,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667324053] [2022-11-22 00:29:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:03,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:29:03,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:29:03,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:29:03,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:29:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:03,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-22 00:29:03,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:29:03,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:03,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:03,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:03,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:03,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:03,800 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-22 00:29:03,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 32 [2022-11-22 00:29:03,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-22 00:29:03,831 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-22 00:29:03,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 190 [2022-11-22 00:29:04,323 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 00:29:04,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 50 [2022-11-22 00:29:04,568 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 00:29:04,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2022-11-22 00:29:04,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2022-11-22 00:29:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:04,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:29:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:05,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667324053] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:29:05,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1158662523] [2022-11-22 00:29:05,587 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-22 00:29:05,587 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:29:05,590 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:29:05,596 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:29:05,597 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:29:05,731 INFO L321 Elim1Store]: treesize reduction 93, result has 14.7 percent of original size [2022-11-22 00:29:05,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 21 [2022-11-22 00:29:05,843 INFO L321 Elim1Store]: treesize reduction 141, result has 10.2 percent of original size [2022-11-22 00:29:05,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 65 treesize of output 65 [2022-11-22 00:29:05,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:05,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:05,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:05,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:05,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:05,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:05,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2022-11-22 00:29:06,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 60 [2022-11-22 00:29:06,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:06,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 73 [2022-11-22 00:29:06,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:06,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:06,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:06,680 INFO L321 Elim1Store]: treesize reduction 102, result has 17.7 percent of original size [2022-11-22 00:29:06,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 470 treesize of output 411 [2022-11-22 00:29:07,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:07,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:07,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:07,225 INFO L321 Elim1Store]: treesize reduction 102, result has 17.7 percent of original size [2022-11-22 00:29:07,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 498 treesize of output 427 [2022-11-22 00:29:07,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:29:07,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:07,842 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 00:29:07,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 00:29:07,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:29:07,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:08,019 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 00:29:08,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 00:29:08,142 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:29:10,860 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '570#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= |ULTIMATE.start_main_#t~nondet17#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (= |ULTIMATE.start_test_fun_#t~malloc5#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= |ULTIMATE.start_main_#t~nondet18#1| 2147483647) (< (+ 2147483647 |ULTIMATE.start_test_fun_#t~mem13#1|) 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~z#1|)) (<= |ULTIMATE.start_test_fun_#in~z#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet18#1|)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet16#1|)) (<= |ULTIMATE.start_main_#t~nondet16#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 0 (+ |ULTIMATE.start_test_fun_~z#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= |ULTIMATE.start_test_fun_~z#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc5#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 00:29:10,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 00:29:10,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:29:10,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-11-22 00:29:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537964457] [2022-11-22 00:29:10,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:29:10,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 00:29:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:29:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 00:29:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2022-11-22 00:29:10,863 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:29:13,211 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-11-22 00:29:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 00:29:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 00:29:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:29:13,214 INFO L225 Difference]: With dead ends: 46 [2022-11-22 00:29:13,214 INFO L226 Difference]: Without dead ends: 45 [2022-11-22 00:29:13,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=446, Invalid=2310, Unknown=0, NotChecked=0, Total=2756 [2022-11-22 00:29:13,216 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 158 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:29:13,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 19 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:29:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-22 00:29:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-11-22 00:29:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-11-22 00:29:13,225 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 13 [2022-11-22 00:29:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:29:13,226 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-11-22 00:29:13,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-11-22 00:29:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 00:29:13,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:29:13,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:29:13,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 00:29:13,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-22 00:29:13,434 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 00:29:13,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:29:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash 190871684, now seen corresponding path program 1 times [2022-11-22 00:29:13,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:29:13,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374552342] [2022-11-22 00:29:13,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:13,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:29:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:13,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:29:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374552342] [2022-11-22 00:29:13,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374552342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:29:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266905116] [2022-11-22 00:29:13,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:13,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:29:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:29:13,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:29:13,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:29:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:13,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-22 00:29:13,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:29:13,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 00:29:13,906 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-22 00:29:13,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2022-11-22 00:29:14,090 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:29:14,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2022-11-22 00:29:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:14,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:29:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:14,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266905116] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-22 00:29:14,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-22 00:29:14,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 7] total 15 [2022-11-22 00:29:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231783225] [2022-11-22 00:29:14,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:29:14,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:29:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:29:14,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:29:14,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-22 00:29:14,264 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:29:14,376 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-11-22 00:29:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:29:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 00:29:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:29:14,377 INFO L225 Difference]: With dead ends: 38 [2022-11-22 00:29:14,377 INFO L226 Difference]: Without dead ends: 37 [2022-11-22 00:29:14,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-11-22 00:29:14,378 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:29:14,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 6 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:29:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-22 00:29:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-11-22 00:29:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 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) [2022-11-22 00:29:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-22 00:29:14,386 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 14 [2022-11-22 00:29:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:29:14,387 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-22 00:29:14,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-22 00:29:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 00:29:14,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:29:14,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-22 00:29:14,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:29:14,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:29:14,594 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 00:29:14,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:29:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1622054974, now seen corresponding path program 1 times [2022-11-22 00:29:14,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:29:14,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104277675] [2022-11-22 00:29:14,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:14,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:29:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 00:29:15,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:29:15,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104277675] [2022-11-22 00:29:15,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104277675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:29:15,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322745385] [2022-11-22 00:29:15,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:15,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:29:15,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:29:15,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:29:15,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:29:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:15,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-22 00:29:15,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:29:15,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-22 00:29:15,453 INFO L321 Elim1Store]: treesize reduction 39, result has 30.4 percent of original size [2022-11-22 00:29:15,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 42 [2022-11-22 00:29:15,644 INFO L321 Elim1Store]: treesize reduction 68, result has 44.7 percent of original size [2022-11-22 00:29:15,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 71 treesize of output 100 [2022-11-22 00:29:20,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:20,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:29:20,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 123 treesize of output 263 [2022-11-22 00:29:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:21,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:29:25,527 INFO L321 Elim1Store]: treesize reduction 89, result has 36.9 percent of original size [2022-11-22 00:29:25,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 127 treesize of output 130 [2022-11-22 00:29:25,564 INFO L321 Elim1Store]: treesize reduction 26, result has 23.5 percent of original size [2022-11-22 00:29:25,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 82 [2022-11-22 00:29:25,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-22 00:29:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:25,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322745385] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:29:25,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1835959973] [2022-11-22 00:29:25,640 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-22 00:29:25,641 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:29:25,641 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:29:25,641 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:29:25,641 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:29:25,742 INFO L321 Elim1Store]: treesize reduction 141, result has 10.2 percent of original size [2022-11-22 00:29:25,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 65 treesize of output 65 [2022-11-22 00:29:25,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-11-22 00:29:25,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:25,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:25,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:25,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:25,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:25,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:25,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2022-11-22 00:29:26,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 60 [2022-11-22 00:29:26,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:26,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 74 [2022-11-22 00:29:26,340 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:26,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:26,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:26,396 INFO L321 Elim1Store]: treesize reduction 102, result has 17.7 percent of original size [2022-11-22 00:29:26,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 516 treesize of output 429 [2022-11-22 00:29:26,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:26,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:26,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:26,779 INFO L321 Elim1Store]: treesize reduction 102, result has 17.7 percent of original size [2022-11-22 00:29:26,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 516 treesize of output 433 [2022-11-22 00:29:27,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:29:27,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:27,220 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 00:29:27,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 00:29:27,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:29:27,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:27,389 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 00:29:27,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 00:29:27,494 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:29:29,818 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1005#(and (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= |ULTIMATE.start_main_#t~nondet17#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (= |ULTIMATE.start_test_fun_#t~malloc5#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem14#1|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= |ULTIMATE.start_main_#t~nondet18#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~z#1|)) (<= |ULTIMATE.start_test_fun_#in~z#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet18#1|)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet16#1|)) (<= |ULTIMATE.start_main_#t~nondet16#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 0 (+ |ULTIMATE.start_test_fun_~z#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (< (+ 2147483647 |ULTIMATE.start_test_fun_#t~mem14#1|) 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= |ULTIMATE.start_test_fun_~z#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc5#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 00:29:29,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 00:29:29,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:29:29,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-22 00:29:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777948564] [2022-11-22 00:29:29,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:29:29,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-22 00:29:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:29:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-22 00:29:29,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=723, Unknown=11, NotChecked=0, Total=870 [2022-11-22 00:29:29,821 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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) [2022-11-22 00:29:39,623 WARN L233 SmtUtils]: Spent 9.33s on a formula simplification. DAG size of input: 52 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:29:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:29:40,540 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-22 00:29:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 00:29:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-22 00:29:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:29:40,541 INFO L225 Difference]: With dead ends: 39 [2022-11-22 00:29:40,542 INFO L226 Difference]: Without dead ends: 38 [2022-11-22 00:29:40,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=284, Invalid=1345, Unknown=11, NotChecked=0, Total=1640 [2022-11-22 00:29:40,543 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:29:40,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 12 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:29:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-22 00:29:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-11-22 00:29:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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) [2022-11-22 00:29:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-11-22 00:29:40,551 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 15 [2022-11-22 00:29:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:29:40,551 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-11-22 00:29:40,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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) [2022-11-22 00:29:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-11-22 00:29:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 00:29:40,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:29:40,553 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2022-11-22 00:29:40,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:29:40,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:29:40,759 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-22 00:29:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:29:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2144419767, now seen corresponding path program 2 times [2022-11-22 00:29:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:29:40,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969010759] [2022-11-22 00:29:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:29:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:29:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:29:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-22 00:29:42,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:29:42,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969010759] [2022-11-22 00:29:42,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969010759] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:29:42,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789436548] [2022-11-22 00:29:42,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:29:42,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:29:42,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:29:42,767 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:29:42,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:29:42,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-22 00:29:42,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:29:42,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-22 00:29:42,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:29:42,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:42,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:43,203 INFO L321 Elim1Store]: treesize reduction 156, result has 31.9 percent of original size [2022-11-22 00:29:43,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 283 [2022-11-22 00:29:43,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:29:43,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 857 treesize of output 847 [2022-11-22 00:29:43,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-22 00:29:43,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-22 00:29:43,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-22 00:29:43,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:43,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:43,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:43,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:43,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:43,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:29:43,948 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-22 00:29:43,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 112 treesize of output 103 [2022-11-22 00:29:43,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-22 00:29:44,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:44,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:44,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:44,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:44,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:44,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:44,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:44,072 INFO L321 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-11-22 00:29:44,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 372 treesize of output 321 [2022-11-22 00:29:44,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 264 [2022-11-22 00:29:44,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 264 treesize of output 262 [2022-11-22 00:29:44,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 260 [2022-11-22 00:29:44,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 258 [2022-11-22 00:29:44,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-22 00:29:44,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:44,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:29:44,452 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-22 00:29:44,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 27 [2022-11-22 00:29:44,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-22 00:29:45,204 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (let ((.cse17 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse24 (<= 0 (+ .cse17 2147483648)))) (or (and .cse0 (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse2 (store (store (store (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6))) (let ((.cse1 (select (store (store (store (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse1 v_DerPreprocessor_2) (<= 0 (+ (select (select .cse2 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483648)) (= .cse1 .cse3) (= .cse4 .cse3) (= v_DerPreprocessor_6 .cse3))))) (exists ((|ULTIMATE.start_test_fun_#t~malloc5#1.base| Int)) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse13 (select |c_#memory_int| |ULTIMATE.start_test_fun_#t~malloc5#1.base|))) (let ((.cse8 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse13))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse10 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse7 v_DerPreprocessor_6) (= .cse4 .cse7) (<= 0 (+ (select (select .cse8 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483648)) (exists ((v_prenex_47 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_48 (Array Int Int))) (let ((.cse12 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_46) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_48) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_47) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse13) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_46) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_48) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_47) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse13))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse9 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse9 .cse10) (= .cse11 v_prenex_48) (= .cse11 .cse7) (= .cse9 v_prenex_46) (= .cse6 .cse9))))) (= .cse10 v_DerPreprocessor_5)))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse16 (store (store (store (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6))) (let ((.cse14 (store (store (store (store (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_45) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_44) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_45) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_44) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6)) (.cse15 (select (select .cse16 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (= v_prenex_45 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select (select .cse14 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse15) (<= 0 (+ .cse15 2147483648)) (= v_DerPreprocessor_6 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse17 .cse15))))) (exists ((|ULTIMATE.start_test_fun_#t~malloc5#1.base| Int)) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse23 (select |c_#memory_int| |ULTIMATE.start_test_fun_#t~malloc5#1.base|))) (let ((.cse18 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse23) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse23))) (let ((.cse22 (select (select .cse18 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse21 (select .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_6) (exists ((v_prenex_50 (Array Int Int)) (v_prenex_51 (Array Int Int)) (v_prenex_49 (Array Int Int))) (let ((.cse20 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_51) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_50) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse23) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_51) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_50) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse23))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse19 v_prenex_49) (= v_prenex_51 (select .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse19 .cse21) (= .cse6 .cse19) (= (select (select .cse20 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse22))))) (= .cse17 .cse22) (<= 0 (+ .cse22 2147483648)) (= .cse21 v_DerPreprocessor_5)))))))))))) (and (not .cse0) .cse24) (and .cse24 (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) is different from true [2022-11-22 00:29:45,587 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (= .cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (.cse1 (not |c_ULTIMATE.start_test_fun_#t~short10#1|))) (or (and (not .cse0) .cse1) (and .cse0 (let ((.cse2 (< .cse3 .cse4))) (or (and .cse2 |c_ULTIMATE.start_test_fun_#t~short10#1|) (and (not .cse2) .cse1))))))) (let ((.cse7 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (or (and .cse7 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6))) (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse9 (store (store (store (store (store (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6))) (let ((.cse8 (select (store (store (store (store (store (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse8 v_DerPreprocessor_2) (<= 0 (+ (select (select .cse9 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483648)) (= .cse8 .cse10) (= .cse5 .cse10) (= v_DerPreprocessor_6 .cse10))))) (exists ((|ULTIMATE.start_test_fun_#t~malloc5#1.base| Int)) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse18 (select |c_#memory_int| |ULTIMATE.start_test_fun_#t~malloc5#1.base|))) (let ((.cse13 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse18) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse18))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse15 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse12 v_DerPreprocessor_6) (= .cse5 .cse12) (<= 0 (+ (select (select .cse13 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483648)) (exists ((v_prenex_47 (Array Int Int)) (v_prenex_46 (Array Int Int)) (v_prenex_48 (Array Int Int))) (let ((.cse17 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_46) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_48) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_47) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse18) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_46) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_48) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_47) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse18))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse14 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse14 .cse15) (= .cse16 v_prenex_48) (= .cse16 .cse12) (= .cse14 v_prenex_46) (= .cse6 .cse14))))) (= .cse15 v_DerPreprocessor_5)))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_prenex_44 (Array Int Int))) (let ((.cse21 (store (store (store (store (store (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6))) (let ((.cse19 (store (store (store (store (store (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_45) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_44) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_45) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_44) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse6)) (.cse20 (select (select .cse21 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|))) (and (= v_prenex_45 (select .cse19 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select (select .cse19 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse20) (<= 0 (+ .cse20 2147483648)) (= v_DerPreprocessor_6 (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 .cse20))))) (exists ((|ULTIMATE.start_test_fun_#t~malloc5#1.base| Int)) (and (not (= |ULTIMATE.start_test_fun_#t~malloc5#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse27 (select |c_#memory_int| |ULTIMATE.start_test_fun_#t~malloc5#1.base|))) (let ((.cse22 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse27) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse27))) (let ((.cse26 (select (select .cse22 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse25 (select .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_DerPreprocessor_6) (exists ((v_prenex_50 (Array Int Int)) (v_prenex_51 (Array Int Int)) (v_prenex_49 (Array Int Int))) (let ((.cse24 (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_51) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_50) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse27) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_51) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_50) |ULTIMATE.start_test_fun_#t~malloc5#1.base| .cse27))) (let ((.cse23 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse23 v_prenex_49) (= v_prenex_51 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse23 .cse25) (= .cse6 .cse23) (= (select (select .cse24 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) .cse26))))) (= .cse3 .cse26) (<= 0 (+ .cse26 2147483648)) (= .cse25 v_DerPreprocessor_5))))))))))) (and (not .cse7) (<= 0 (+ .cse3 2147483648))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from true [2022-11-22 00:29:45,878 INFO L321 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2022-11-22 00:29:45,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 42 [2022-11-22 00:29:46,014 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-22 00:29:46,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 44 [2022-11-22 00:29:46,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-11-22 00:29:46,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-11-22 00:29:46,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2022-11-22 00:29:46,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-11-22 00:29:46,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2022-11-22 00:29:47,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-11-22 00:29:47,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2022-11-22 00:29:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:47,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:30:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 44 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:30:49,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789436548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:30:49,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1171576319] [2022-11-22 00:30:49,054 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-22 00:30:49,054 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 00:30:49,054 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 00:30:49,055 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 00:30:49,055 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 00:30:49,166 INFO L321 Elim1Store]: treesize reduction 141, result has 10.2 percent of original size [2022-11-22 00:30:49,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 65 treesize of output 65 [2022-11-22 00:30:49,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-11-22 00:30:49,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2022-11-22 00:30:49,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 60 [2022-11-22 00:30:49,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:30:49,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 71 [2022-11-22 00:30:49,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:30:49,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:30:49,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:30:49,747 INFO L321 Elim1Store]: treesize reduction 102, result has 17.7 percent of original size [2022-11-22 00:30:49,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 497 treesize of output 426 [2022-11-22 00:30:49,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:30:49,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:30:49,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:30:50,047 INFO L321 Elim1Store]: treesize reduction 102, result has 17.7 percent of original size [2022-11-22 00:30:50,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 502 treesize of output 435 [2022-11-22 00:30:50,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:30:50,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:30:50,388 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 00:30:50,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 00:30:50,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:30:50,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 00:30:50,546 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-22 00:30:50,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 45 [2022-11-22 00:30:50,662 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 00:30:53,853 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1344#(and (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~y#1|)) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= |ULTIMATE.start_main_#t~nondet17#1| 2147483647) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 |ULTIMATE.start_test_fun_#t~malloc4#1.base|) (= |ULTIMATE.start_test_fun_#t~malloc5#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~y#1| 2147483647) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (<= 0 (+ |ULTIMATE.start_test_fun_~y#1| 2147483648)) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) (<= |ULTIMATE.start_main_#t~nondet18#1| 2147483647) (< (+ 2147483647 |ULTIMATE.start_test_fun_#t~mem13#1|) 0) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_test_fun_#in~y#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_~z_ref~0#1.base|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~z#1|)) (<= |ULTIMATE.start_test_fun_#in~z#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc4#1.offset| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet18#1|)) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet16#1|)) (<= |ULTIMATE.start_main_#t~nondet16#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= 0 (+ |ULTIMATE.start_test_fun_~z#1| 2147483648)) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (<= 0 |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (<= |ULTIMATE.start_test_fun_~z#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc5#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 00:30:53,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 00:30:53,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:30:53,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 17] total 41 [2022-11-22 00:30:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258465930] [2022-11-22 00:30:53,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:30:53,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-22 00:30:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:30:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-22 00:30:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=2000, Unknown=26, NotChecked=190, Total=2550 [2022-11-22 00:30:53,857 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 42 states have internal predecessors, (73), 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) [2022-11-22 00:31:02,741 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 187 DAG size of output: 183 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:31:09,926 WARN L233 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 206 DAG size of output: 188 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:31:17,480 WARN L233 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 188 DAG size of output: 184 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:31:27,153 WARN L233 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 207 DAG size of output: 189 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:31:34,029 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 189 DAG size of output: 185 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:31:43,491 WARN L233 SmtUtils]: Spent 7.88s on a formula simplification. DAG size of input: 208 DAG size of output: 190 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:31:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:31:53,201 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2022-11-22 00:31:53,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-22 00:31:53,202 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 42 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-22 00:31:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:31:53,202 INFO L225 Difference]: With dead ends: 126 [2022-11-22 00:31:53,202 INFO L226 Difference]: Without dead ends: 0 [2022-11-22 00:31:53,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2428 ImplicationChecksByTransitivity, 119.8s TimeCoverageRelationStatistics Valid=1340, Invalid=6124, Unknown=26, NotChecked=342, Total=7832 [2022-11-22 00:31:53,206 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 246 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:31:53,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 19 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 294 Invalid, 0 Unknown, 63 Unchecked, 2.2s Time] [2022-11-22 00:31:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-22 00:31:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-22 00:31:53,208 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) [2022-11-22 00:31:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-22 00:31:53,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2022-11-22 00:31:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:31:53,209 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-22 00:31:53,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 42 states have internal predecessors, (73), 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) [2022-11-22 00:31:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-22 00:31:53,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-22 00:31:53,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-22 00:31:53,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-22 00:31:53,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-22 00:31:53,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-22 00:31:53,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-22 00:31:53,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:31:53,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-22 00:32:03,082 WARN L233 SmtUtils]: Spent 9.53s on a formula simplification. DAG size of input: 299 DAG size of output: 297 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-22 00:32:43,349 WARN L233 SmtUtils]: Spent 40.26s on a formula simplification. DAG size of input: 271 DAG size of output: 39 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:33:29,343 WARN L233 SmtUtils]: Spent 45.99s on a formula simplification. DAG size of input: 297 DAG size of output: 48 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-22 00:33:29,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2022-11-22 00:33:29,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-22 00:33:29,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2022-11-22 00:33:29,346 INFO L899 garLoopResultBuilder]: For program point L560(line 560) no Hoare annotation was computed. [2022-11-22 00:33:29,346 INFO L899 garLoopResultBuilder]: For program point L560-1(line 560) no Hoare annotation was computed. [2022-11-22 00:33:29,346 INFO L899 garLoopResultBuilder]: For program point L558-1(lines 558 561) no Hoare annotation was computed. [2022-11-22 00:33:29,346 INFO L895 garLoopResultBuilder]: At program point L558-3(lines 558 561) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse1 (select .cse0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (forall ((v_ArrVal_498 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_498)) |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483649) (< .cse1 (+ v_ArrVal_498 1)))) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse1 .cse2) (<= .cse2 (+ .cse1 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483648)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)))) [2022-11-22 00:33:29,346 INFO L895 garLoopResultBuilder]: At program point L558-4(lines 557 562) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|)) (.cse8 (select .cse10 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse1 (forall ((v_ArrVal_498 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse10 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_498)) |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483649) (< .cse8 (+ v_ArrVal_498 1))))) (.cse2 (< .cse8 2147483649)) (.cse3 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (.cse5 (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse6 (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0)) (.cse7 (<= 0 (+ .cse9 2147483648)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| 0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) (+ .cse8 .cse9 2147483648)) .cse6 .cse7))))) [2022-11-22 00:33:29,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2022-11-22 00:33:29,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 560) no Hoare annotation was computed. [2022-11-22 00:33:29,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-22 00:33:29,347 INFO L899 garLoopResultBuilder]: For program point L559(line 559) no Hoare annotation was computed. [2022-11-22 00:33:29,347 INFO L899 garLoopResultBuilder]: For program point L559-1(line 559) no Hoare annotation was computed. [2022-11-22 00:33:29,347 INFO L899 garLoopResultBuilder]: For program point L557-3(lines 557 562) no Hoare annotation was computed. [2022-11-22 00:33:29,347 INFO L902 garLoopResultBuilder]: At program point L557-5(lines 557 562) the Hoare annotation is: true [2022-11-22 00:33:29,351 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:33:29,353 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 00:33:29,364 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,365 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,373 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:33:29 BoogieIcfgContainer [2022-11-22 00:33:29,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 00:33:29,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 00:33:29,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 00:33:29,381 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 00:33:29,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:28:57" (3/4) ... [2022-11-22 00:33:29,385 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-22 00:33:29,396 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-22 00:33:29,396 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-22 00:33:29,396 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-22 00:33:29,397 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-22 00:33:29,436 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 00:33:29,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 00:33:29,437 INFO L158 Benchmark]: Toolchain (without parser) took 273051.31ms. Allocated memory was 163.6MB in the beginning and 415.2MB in the end (delta: 251.7MB). Free memory was 118.2MB in the beginning and 366.0MB in the end (delta: -247.8MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-11-22 00:33:29,438 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory was 104.9MB in the beginning and 104.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 00:33:29,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.72ms. Allocated memory is still 163.6MB. Free memory was 118.2MB in the beginning and 102.3MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-22 00:33:29,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.75ms. Allocated memory is still 163.6MB. Free memory was 102.3MB in the beginning and 100.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:33:29,439 INFO L158 Benchmark]: Boogie Preprocessor took 55.20ms. Allocated memory is still 163.6MB. Free memory was 100.8MB in the beginning and 99.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:33:29,439 INFO L158 Benchmark]: RCFGBuilder took 470.07ms. Allocated memory is still 163.6MB. Free memory was 99.4MB in the beginning and 83.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-22 00:33:29,439 INFO L158 Benchmark]: TraceAbstraction took 271958.34ms. Allocated memory was 163.6MB in the beginning and 415.2MB in the end (delta: 251.7MB). Free memory was 83.2MB in the beginning and 369.2MB in the end (delta: -286.0MB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. [2022-11-22 00:33:29,440 INFO L158 Benchmark]: Witness Printer took 56.29ms. Allocated memory is still 415.2MB. Free memory was 369.2MB in the beginning and 366.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 00:33:29,441 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory was 104.9MB in the beginning and 104.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.72ms. Allocated memory is still 163.6MB. Free memory was 118.2MB in the beginning and 102.3MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.75ms. Allocated memory is still 163.6MB. Free memory was 102.3MB in the beginning and 100.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.20ms. Allocated memory is still 163.6MB. Free memory was 100.8MB in the beginning and 99.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.07ms. Allocated memory is still 163.6MB. Free memory was 99.4MB in the beginning and 83.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 271958.34ms. Allocated memory was 163.6MB in the beginning and 415.2MB in the end (delta: 251.7MB). Free memory was 83.2MB in the beginning and 369.2MB in the end (delta: -286.0MB). Peak memory consumption was 203.7MB. Max. memory is 16.1GB. * Witness Printer took 56.29ms. Allocated memory is still 415.2MB. Free memory was 369.2MB in the beginning and 366.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] * 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: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 560]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 271.9s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 73.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 95.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 63 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 829 IncrementalHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 33 mSDtfsCounter, 829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 239 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3654 ImplicationChecksByTransitivity, 146.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=6, InterpolantAutomatonStates: 130, 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, 49 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 35 NumberOfFragments, 219 HoareAnnotationTreeSize, 3 FomulaSimplifications, 38986 FormulaSimplificationTreeSizeReduction, 9.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 417253 FormulaSimplificationTreeSizeReductionInter, 86.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 86.0s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 266 ConstructedInterpolants, 66 QuantifiedInterpolants, 62703 SizeOfPredicates, 77 NumberOfNonLiveVariables, 977 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 51/210 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 558]: Loop Invariant [2022-11-22 00:33:29,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,471 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,473 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] Derived loop invariant: ((((((!(y_ref == x_ref) && (forall v_ArrVal_498 : int :: unknown-#memory_int-unknown[x_ref := unknown-#memory_int-unknown[x_ref][x_ref := v_ArrVal_498]][y_ref][y_ref] < 2147483649 || unknown-#memory_int-unknown[x_ref][x_ref] < v_ArrVal_498 + 1)) && x_ref == 0) && !(z_ref == y_ref)) && !(z_ref == x_ref)) && unknown-#memory_int-unknown[x_ref][x_ref] <= unknown-#memory_int-unknown[y_ref][y_ref]) && unknown-#memory_int-unknown[y_ref][y_ref] <= unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[z_ref][z_ref] + 2147483648) && y_ref == 0 - InvariantResult [Line: 557]: Loop Invariant [2022-11-22 00:33:29,474 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,475 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,490 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,491 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] [2022-11-22 00:33:29,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_498,QUANTIFIED] Derived loop invariant: ((((((((!(y_ref == x_ref) && (forall v_ArrVal_498 : int :: unknown-#memory_int-unknown[x_ref := unknown-#memory_int-unknown[x_ref][x_ref := v_ArrVal_498]][y_ref][y_ref] < 2147483649 || unknown-#memory_int-unknown[x_ref][x_ref] < v_ArrVal_498 + 1)) && unknown-#memory_int-unknown[x_ref][x_ref] < 2147483649) && x_ref == 0) && !(z_ref == y_ref)) && !(z_ref == x_ref)) && z_ref == 0) && y_ref == 0) && 0 <= unknown-#memory_int-unknown[z_ref][z_ref] + 2147483648) || ((((((((!(y_ref == x_ref) && (forall v_ArrVal_498 : int :: unknown-#memory_int-unknown[x_ref := unknown-#memory_int-unknown[x_ref][x_ref := v_ArrVal_498]][y_ref][y_ref] < 2147483649 || unknown-#memory_int-unknown[x_ref][x_ref] < v_ArrVal_498 + 1)) && unknown-#memory_int-unknown[x_ref][x_ref] < 2147483649) && x_ref == 0) && !(z_ref == y_ref)) && !(z_ref == x_ref)) && unknown-#memory_int-unknown[y_ref][y_ref] <= unknown-#memory_int-unknown[x_ref][x_ref] + unknown-#memory_int-unknown[z_ref][z_ref] + 2147483648) && y_ref == 0) && 0 <= unknown-#memory_int-unknown[z_ref][z_ref] + 2147483648) RESULT: Ultimate proved your program to be correct! [2022-11-22 00:33:29,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_772132ce-d574-4c87-92c2-e3604049c798/bin/utaipan-g80aRyZoba/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