./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/revcpyswp2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-tiling/revcpyswp2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5d836305a9654c4a87b407d535438bc329bb78fc0805b3b823600303a7df507 --- 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-5e519f3 [2022-11-02 20:48:26,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:48:26,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:48:26,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:48:26,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:48:26,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:48:26,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:48:26,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:48:26,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:48:26,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:48:26,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:48:26,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:48:26,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:48:26,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:48:26,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:48:26,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:48:26,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:48:26,612 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:48:26,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:48:26,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:48:26,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:48:26,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:48:26,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:48:26,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:48:26,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:48:26,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:48:26,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:48:26,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:48:26,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:48:26,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:48:26,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:48:26,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:48:26,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:48:26,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:48:26,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:48:26,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:48:26,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:48:26,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:48:26,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:48:26,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:48:26,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:48:26,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:48:26,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:48:26,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:48:26,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:48:26,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:48:26,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:48:26,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:48:26,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:48:26,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:48:26,688 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:48:26,689 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:48:26,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:48:26,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:48:26,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:48:26,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:48:26,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:48:26,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:48:26,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:48:26,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:48:26,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:48:26,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:48:26,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:48:26,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:48:26,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:48:26,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:48:26,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:48:26,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:48:26,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:48:26,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:48:26,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:48:26,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:48:26,699 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:48:26,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:48:26,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:48:26,700 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_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/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_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5d836305a9654c4a87b407d535438bc329bb78fc0805b3b823600303a7df507 [2022-11-02 20:48:26,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:48:26,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:48:26,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:48:26,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:48:26,999 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:48:27,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/array-tiling/revcpyswp2.c [2022-11-02 20:48:27,069 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/data/cd8624c88/e5bdc82a1da54843a835f76c560251ed/FLAGb682750dc [2022-11-02 20:48:27,504 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:48:27,505 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/sv-benchmarks/c/array-tiling/revcpyswp2.c [2022-11-02 20:48:27,511 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/data/cd8624c88/e5bdc82a1da54843a835f76c560251ed/FLAGb682750dc [2022-11-02 20:48:27,899 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/data/cd8624c88/e5bdc82a1da54843a835f76c560251ed [2022-11-02 20:48:27,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:48:27,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:48:27,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:48:27,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:48:27,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:48:27,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:48:27" (1/1) ... [2022-11-02 20:48:27,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fac01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:27, skipping insertion in model container [2022-11-02 20:48:27,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:48:27" (1/1) ... [2022-11-02 20:48:27,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:48:27,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:48:28,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/sv-benchmarks/c/array-tiling/revcpyswp2.c[432,445] [2022-11-02 20:48:28,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:48:28,219 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:48:28,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/sv-benchmarks/c/array-tiling/revcpyswp2.c[432,445] [2022-11-02 20:48:28,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:48:28,253 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:48:28,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28 WrapperNode [2022-11-02 20:48:28,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:48:28,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:48:28,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:48:28,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:48:28,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,291 INFO L138 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2022-11-02 20:48:28,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:48:28,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:48:28,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:48:28,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:48:28,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,316 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:48:28,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:48:28,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:48:28,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:48:28,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (1/1) ... [2022-11-02 20:48:28,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:48:28,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:28,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:48:28,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:48:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:48:28,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:48:28,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:48:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:48:28,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:48:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:48:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:48:28,503 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:48:28,506 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:48:28,800 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:48:28,806 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:48:28,806 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:48:28,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:48:28 BoogieIcfgContainer [2022-11-02 20:48:28,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:48:28,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:48:28,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:48:28,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:48:28,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:48:27" (1/3) ... [2022-11-02 20:48:28,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71143da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:48:28, skipping insertion in model container [2022-11-02 20:48:28,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:48:28" (2/3) ... [2022-11-02 20:48:28,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71143da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:48:28, skipping insertion in model container [2022-11-02 20:48:28,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:48:28" (3/3) ... [2022-11-02 20:48:28,826 INFO L112 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2022-11-02 20:48:28,846 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:48:28,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:48:28,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:48:28,918 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@44696414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:48:28,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:48:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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-02 20:48:28,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:28,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:28,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:28,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:28,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:28,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1560213877, now seen corresponding path program 1 times [2022-11-02 20:48:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:28,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915262794] [2022-11-02 20:48:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:28,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:29,121 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-02 20:48:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:29,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915262794] [2022-11-02 20:48:29,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915262794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:29,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:29,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:48:29,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844342049] [2022-11-02 20:48:29,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:29,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:48:29,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:29,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:48:29,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:48:29,160 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-02 20:48:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:29,176 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-11-02 20:48:29,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:48:29,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-02 20:48:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:29,185 INFO L225 Difference]: With dead ends: 45 [2022-11-02 20:48:29,186 INFO L226 Difference]: Without dead ends: 21 [2022-11-02 20:48:29,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:48:29,192 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:29,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:48:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-02 20:48:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-02 20:48:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-02 20:48:29,224 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-11-02 20:48:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:29,224 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-02 20:48:29,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-02 20:48:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-02 20:48:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:48:29,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:29,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:29,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:48:29,226 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:29,226 INFO L85 PathProgramCache]: Analyzing trace with hash 631559685, now seen corresponding path program 1 times [2022-11-02 20:48:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:29,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446304375] [2022-11-02 20:48:29,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:29,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:29,505 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-02 20:48:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:29,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446304375] [2022-11-02 20:48:29,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446304375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:29,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:29,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:48:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230032051] [2022-11-02 20:48:29,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:29,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:29,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:29,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:29,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:29,509 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-02 20:48:29,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:29,558 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-11-02 20:48:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:29,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-02 20:48:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:29,559 INFO L225 Difference]: With dead ends: 39 [2022-11-02 20:48:29,560 INFO L226 Difference]: Without dead ends: 23 [2022-11-02 20:48:29,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:29,561 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:29,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:48:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-02 20:48:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-11-02 20:48:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) 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-02 20:48:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-11-02 20:48:29,567 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2022-11-02 20:48:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:29,568 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-11-02 20:48:29,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-02 20:48:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-11-02 20:48:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:48:29,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:29,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:29,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:48:29,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash -971977821, now seen corresponding path program 1 times [2022-11-02 20:48:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:29,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450972930] [2022-11-02 20:48:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:29,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:48:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:29,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450972930] [2022-11-02 20:48:29,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450972930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:29,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:29,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:48:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045214214] [2022-11-02 20:48:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:29,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:48:29,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:48:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:29,793 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:29,896 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-11-02 20:48:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:48:29,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:48:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:29,900 INFO L225 Difference]: With dead ends: 48 [2022-11-02 20:48:29,901 INFO L226 Difference]: Without dead ends: 35 [2022-11-02 20:48:29,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:48:29,905 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:29,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 15 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-02 20:48:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-11-02 20:48:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-02 20:48:29,924 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2022-11-02 20:48:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:29,925 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-02 20:48:29,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-02 20:48:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:48:29,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:29,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:29,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:48:29,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:29,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1185722883, now seen corresponding path program 1 times [2022-11-02 20:48:29,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:29,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359334117] [2022-11-02 20:48:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:29,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:48:30,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:30,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359334117] [2022-11-02 20:48:30,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359334117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:30,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747342016] [2022-11-02 20:48:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:30,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:30,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:30,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:30,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:48:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:30,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:48:30,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:48:30,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:48:30,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747342016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:30,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:30,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-02 20:48:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686700617] [2022-11-02 20:48:30,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:30,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:48:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:30,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:48:30,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:30,404 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:30,462 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-11-02 20:48:30,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:48:30,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:48:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:30,464 INFO L225 Difference]: With dead ends: 47 [2022-11-02 20:48:30,464 INFO L226 Difference]: Without dead ends: 28 [2022-11-02 20:48:30,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:48:30,465 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:30,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:48:30,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-02 20:48:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-11-02 20:48:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-02 20:48:30,470 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 22 [2022-11-02 20:48:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:30,471 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-02 20:48:30,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-02 20:48:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:48:30,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:30,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:30,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:30,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:30,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:30,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1086929509, now seen corresponding path program 2 times [2022-11-02 20:48:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:30,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060984470] [2022-11-02 20:48:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:30,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:48:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:30,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060984470] [2022-11-02 20:48:30,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060984470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:30,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924677426] [2022-11-02 20:48:30,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:48:30,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:30,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:30,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:30,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:48:30,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:48:30,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:48:30,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:48:30,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:48:31,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:48:31,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924677426] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:31,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:31,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-02 20:48:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8906174] [2022-11-02 20:48:31,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:31,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:48:31,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:31,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:48:31,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:48:31,116 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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-02 20:48:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:31,243 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-11-02 20:48:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:31,244 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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 24 [2022-11-02 20:48:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:31,247 INFO L225 Difference]: With dead ends: 64 [2022-11-02 20:48:31,248 INFO L226 Difference]: Without dead ends: 49 [2022-11-02 20:48:31,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:48:31,250 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:31,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 27 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:48:31,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-02 20:48:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2022-11-02 20:48:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 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-02 20:48:31,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-11-02 20:48:31,264 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2022-11-02 20:48:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:31,264 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-11-02 20:48:31,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 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-02 20:48:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-11-02 20:48:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:48:31,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:31,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:31,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:31,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:31,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:48:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1519365621, now seen corresponding path program 3 times [2022-11-02 20:48:31,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:31,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615995936] [2022-11-02 20:48:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:31,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:35,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:35,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615995936] [2022-11-02 20:48:35,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615995936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:35,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074563591] [2022-11-02 20:48:35,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:48:35,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:35,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:35,175 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:35,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40fb3381-9ccb-4255-a8db-a0c7708e13db/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:48:35,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:48:35,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:48:35,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-02 20:48:35,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:35,416 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-11-02 20:48:35,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1565 treesize of output 1537 [2022-11-02 20:48:35,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-11-02 20:48:35,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:48:36,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-11-02 20:48:36,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-11-02 20:48:36,188 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:48:36,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 46 [2022-11-02 20:48:36,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-11-02 20:48:36,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:36,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-11-02 20:48:36,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 21 [2022-11-02 20:48:36,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 16 [2022-11-02 20:48:36,584 INFO L356 Elim1Store]: treesize reduction 14, result has 63.2 percent of original size [2022-11-02 20:48:36,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 72 treesize of output 61 [2022-11-02 20:48:36,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2022-11-02 20:48:36,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-11-02 20:48:36,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-02 20:48:37,004 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:48:37,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 55 [2022-11-02 20:48:37,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 47 [2022-11-02 20:48:37,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-11-02 20:48:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:37,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:37,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~SIZE~0) (forall ((v_ArrVal_385 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_385))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))))) is different from false [2022-11-02 20:48:37,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_385 (Array Int Int))) (or (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_382 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_385))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-11-02 20:48:37,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_385 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0) (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_382 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_385))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) is different from false [2022-11-02 20:48:37,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_378 Int) (v_ArrVal_382 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_385 (Array Int Int))) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse7 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse6 (+ .cse7 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse6))))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 v_ArrVal_378))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_382 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_385))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~SIZE~0))) is different from false [2022-11-02 20:48:38,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_382 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_385 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse8 (* |v_ULTIMATE.start_main_~i~0#1_61| 4))) (let ((.cse6 (+ .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse5 (let ((.cse9 (let ((.cse10 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| .cse9))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse9 .cse6))))))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 v_ArrVal_378))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_382 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_385))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~SIZE~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-11-02 20:48:38,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_382 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_385 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse8 (* |v_ULTIMATE.start_main_~i~0#1_61| 4))) (let ((.cse6 (+ .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse5 (let ((.cse9 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| .cse9))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse9 .cse6))))))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 v_ArrVal_378))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_382 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_385))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~SIZE~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-11-02 20:48:38,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_368 Int) (v_ArrVal_378 Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_382 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_385 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_61| Int) (v_ArrVal_367 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~SIZE~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse8 (* |v_ULTIMATE.start_main_~i~0#1_61| 4))) (let ((.cse6 (+ .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse5 (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_368)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_367))) (let ((.cse9 (store (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (store (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| .cse9))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse9 .cse6)))))))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 v_ArrVal_378))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_382 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_385))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~SIZE~0))) is different from false [2022-11-02 20:48:38,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 Int) (v_ArrVal_378 Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_382 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_365 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_61| Int) (v_ArrVal_367 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~SIZE~0) (let ((.cse1 (* 4 c_~SIZE~0))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse9 (* |v_ULTIMATE.start_main_~i~0#1_61| 4))) (let ((.cse7 (+ .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse6 (let ((.cse11 (store (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* (- 4) |c_ULTIMATE.start_main_~i~0#1|) (- 4) .cse1)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_365))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_368))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_367))) (let ((.cse10 (store (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| .cse10))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse10 .cse7)))))))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) .cse7 v_ArrVal_378))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| .cse5))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_382 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_385))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) c_~SIZE~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-11-02 20:48:38,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 Int) (v_ArrVal_378 Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_382 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_65| Int) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_385 (Array Int Int)) (v_ArrVal_365 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_61| Int) (v_ArrVal_367 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~SIZE~0) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse9 (* |v_ULTIMATE.start_main_~i~0#1_61| 4))) (let ((.cse7 (+ .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse6 (let ((.cse11 (store (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_365))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_65| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_368))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_367))) (let ((.cse10 (store (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_371) |c_ULTIMATE.start_main_~b~0#1.base| .cse10))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse10 .cse7)))))))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) .cse7 v_ArrVal_378))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| .cse5))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_382))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_57| 4))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_382 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_385))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_65| 1) c_~SIZE~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_57| 1) c_~SIZE~0))) is different from false [2022-11-02 20:48:39,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:39,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24762 treesize of output 13255