./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.07-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6c280f9f662c2cce7ccc19dad49f017ee13d6783374dc482c07b9bbe0ddd8f5 --- 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-8393723 [2022-11-18 18:33:00,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:33:00,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:33:00,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:33:00,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:33:00,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:33:00,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:33:00,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:33:00,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:33:00,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:33:00,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:33:00,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:33:00,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:33:00,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:33:00,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:33:00,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:33:00,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:33:00,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:33:00,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:33:00,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:33:00,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:33:00,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:33:00,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:33:00,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:33:00,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:33:00,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:33:00,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:33:00,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:33:00,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:33:00,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:33:00,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:33:00,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:33:00,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:33:00,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:33:00,169 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:33:00,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:33:00,170 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:33:00,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:33:00,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:33:00,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:33:00,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:33:00,174 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-18 18:33:00,211 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:33:00,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:33:00,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:33:00,219 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:33:00,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:33:00,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:33:00,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:33:00,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:33:00,222 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:33:00,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:33:00,224 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:33:00,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:33:00,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:33:00,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:33:00,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:33:00,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:33:00,226 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 18:33:00,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:33:00,226 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:33:00,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:33:00,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:33:00,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:33:00,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:33:00,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:33:00,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:33:00,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:33:00,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:33:00,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:33:00,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:33:00,229 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:33:00,229 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:33:00,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:33:00,230 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_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/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_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c280f9f662c2cce7ccc19dad49f017ee13d6783374dc482c07b9bbe0ddd8f5 [2022-11-18 18:33:00,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:33:00,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:33:00,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:33:00,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:33:00,565 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:33:00,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/termination-memory-alloca/a.07-alloca.i [2022-11-18 18:33:00,645 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/data/7402ad575/2bab4012b32b454db116dd5fdde8c8de/FLAG7520ad0f3 [2022-11-18 18:33:01,254 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:33:01,255 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/sv-benchmarks/c/termination-memory-alloca/a.07-alloca.i [2022-11-18 18:33:01,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/data/7402ad575/2bab4012b32b454db116dd5fdde8c8de/FLAG7520ad0f3 [2022-11-18 18:33:01,548 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/data/7402ad575/2bab4012b32b454db116dd5fdde8c8de [2022-11-18 18:33:01,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:33:01,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:33:01,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:33:01,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:33:01,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:33:01,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:01" (1/1) ... [2022-11-18 18:33:01,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408f4a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:01, skipping insertion in model container [2022-11-18 18:33:01,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:01" (1/1) ... [2022-11-18 18:33:01,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:33:01,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:33:01,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:33:01,992 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:33:02,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:33:02,104 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:33:02,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02 WrapperNode [2022-11-18 18:33:02,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:33:02,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:33:02,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:33:02,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:33:02,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,168 INFO L138 Inliner]: procedures = 111, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2022-11-18 18:33:02,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:33:02,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:33:02,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:33:02,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:33:02,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,221 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:33:02,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:33:02,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:33:02,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:33:02,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (1/1) ... [2022-11-18 18:33:02,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:33:02,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:33:02,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:33:02,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:33:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 18:33:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:33:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:33:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:33:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:33:02,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:33:02,475 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:33:02,477 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:33:02,686 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:33:02,692 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:33:02,693 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-18 18:33:02,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:02 BoogieIcfgContainer [2022-11-18 18:33:02,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:33:02,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:33:02,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:33:02,701 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:33:02,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:33:01" (1/3) ... [2022-11-18 18:33:02,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a391b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:02, skipping insertion in model container [2022-11-18 18:33:02,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:02" (2/3) ... [2022-11-18 18:33:02,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a391b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:02, skipping insertion in model container [2022-11-18 18:33:02,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:02" (3/3) ... [2022-11-18 18:33:02,704 INFO L112 eAbstractionObserver]: Analyzing ICFG a.07-alloca.i [2022-11-18 18:33:02,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:33:02,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-18 18:33:02,788 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:33:02,795 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;@2a80a473, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:33:02,796 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 18:33:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 18:33:02,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:33:02,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 18:33:02,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:33:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 889569447, now seen corresponding path program 1 times [2022-11-18 18:33:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:02,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530550063] [2022-11-18 18:33:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:04,416 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-18 18:33:04,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:04,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530550063] [2022-11-18 18:33:04,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530550063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:04,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:04,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:33:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938895394] [2022-11-18 18:33:04,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:04,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:33:04,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:33:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:33:04,481 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:33:04,835 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-11-18 18:33:04,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:33:04,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-18 18:33:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:33:04,852 INFO L225 Difference]: With dead ends: 23 [2022-11-18 18:33:04,854 INFO L226 Difference]: Without dead ends: 12 [2022-11-18 18:33:04,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:33:04,881 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:33:04,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:33:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-18 18:33:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-18 18:33:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 11 states have internal predecessors, (13), 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-18 18:33:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-18 18:33:04,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 6 [2022-11-18 18:33:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:33:04,921 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-18 18:33:04,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-18 18:33:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-18 18:33:04,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:33:04,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:04,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:33:04,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:33:04,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:04,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849133, now seen corresponding path program 1 times [2022-11-18 18:33:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:04,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998528499] [2022-11-18 18:33:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:05,808 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-18 18:33:05,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:05,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998528499] [2022-11-18 18:33:05,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998528499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:05,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:05,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:33:05,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091143608] [2022-11-18 18:33:05,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:05,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:33:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:05,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:33:05,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:33:05,817 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:33:05,868 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-11-18 18:33:05,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:33:05,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-18 18:33:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:33:05,871 INFO L225 Difference]: With dead ends: 12 [2022-11-18 18:33:05,871 INFO L226 Difference]: Without dead ends: 11 [2022-11-18 18:33:05,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:33:05,878 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:33:05,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 13 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:33:05,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-18 18:33:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-18 18:33:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-18 18:33:05,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 7 [2022-11-18 18:33:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:33:05,889 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-18 18:33:05,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-18 18:33:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 18:33:05,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:33:05,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:05,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:33:05,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:33:05,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:05,900 INFO L85 PathProgramCache]: Analyzing trace with hash 177748329, now seen corresponding path program 1 times [2022-11-18 18:33:05,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:05,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715483460] [2022-11-18 18:33:05,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:05,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:07,167 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-18 18:33:07,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:07,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715483460] [2022-11-18 18:33:07,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715483460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:07,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:07,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:33:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585387292] [2022-11-18 18:33:07,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:07,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:33:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:07,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:33:07,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:33:07,178 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:33:07,365 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-11-18 18:33:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:33:07,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 18:33:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:33:07,368 INFO L225 Difference]: With dead ends: 23 [2022-11-18 18:33:07,368 INFO L226 Difference]: Without dead ends: 22 [2022-11-18 18:33:07,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:33:07,378 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 18 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-18 18:33:07,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 18 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:33:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-18 18:33:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-11-18 18:33:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-18 18:33:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-18 18:33:07,389 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 8 [2022-11-18 18:33:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:33:07,390 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-18 18:33:07,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-18 18:33:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 18:33:07,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:33:07,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:07,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:33:07,392 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:33:07,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:07,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1215230959, now seen corresponding path program 1 times [2022-11-18 18:33:07,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:07,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326745477] [2022-11-18 18:33:07,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:07,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:07,633 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-18 18:33:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:07,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326745477] [2022-11-18 18:33:07,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326745477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:07,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:07,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:33:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781401974] [2022-11-18 18:33:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:07,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 18:33:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:07,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 18:33:07,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 18:33:07,637 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:33:07,673 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-11-18 18:33:07,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 18:33:07,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 18:33:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:33:07,675 INFO L225 Difference]: With dead ends: 17 [2022-11-18 18:33:07,675 INFO L226 Difference]: Without dead ends: 16 [2022-11-18 18:33:07,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:33:07,684 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:33:07,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:33:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-18 18:33:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-18 18:33:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-11-18 18:33:07,692 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-11-18 18:33:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:33:07,692 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-11-18 18:33:07,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-11-18 18:33:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 18:33:07,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:33:07,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-18 18:33:07,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:33:07,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:33:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash -326396970, now seen corresponding path program 1 times [2022-11-18 18:33:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:07,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070761733] [2022-11-18 18:33:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:09,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:09,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070761733] [2022-11-18 18:33:09,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070761733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:33:09,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813160497] [2022-11-18 18:33:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:09,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:33:09,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:33:09,026 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:33:09,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 18:33:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:09,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-18 18:33:09,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:33:09,317 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 18:33:09,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-18 18:33:09,391 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-18 18:33:09,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 256 treesize of output 216 [2022-11-18 18:33:09,726 INFO L321 Elim1Store]: treesize reduction 183, result has 33.0 percent of original size [2022-11-18 18:33:09,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 208 treesize of output 427 [2022-11-18 18:33:09,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-18 18:33:09,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 18:33:09,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 18:33:10,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 18:33:10,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 59 [2022-11-18 18:33:10,138 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:33:10,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2022-11-18 18:33:10,586 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:33:12,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:12,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:12,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:12,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:33:12,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 107 treesize of output 94 [2022-11-18 18:33:12,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 18 [2022-11-18 18:33:12,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-18 18:33:12,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:33:12,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:33:12,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:12,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:12,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:33:12,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:33:12,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:33:12,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 209 [2022-11-18 18:33:12,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:33:12,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:33:12,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:12,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:12,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:33:12,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:33:12,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 390 treesize of output 317 [2022-11-18 18:33:12,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2022-11-18 18:33:12,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:33:12,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2022-11-18 18:33:12,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:33:12,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:33:15,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:15,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:15,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:15,962 INFO L321 Elim1Store]: treesize reduction 60, result has 36.8 percent of original size [2022-11-18 18:33:15,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 925 treesize of output 866 [2022-11-18 18:33:16,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 856 treesize of output 854 [2022-11-18 18:33:16,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 854 treesize of output 852 [2022-11-18 18:33:16,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:33:16,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 113 [2022-11-18 18:33:16,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 18:33:16,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-11-18 18:33:16,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 18:33:16,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 95 [2022-11-18 18:33:16,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 18:33:16,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:33:16,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2022-11-18 18:33:16,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2022-11-18 18:33:17,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2022-11-18 18:33:17,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-18 18:33:17,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:33:17,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 12 [2022-11-18 18:33:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:17,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:33:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:24,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813160497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:33:24,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:33:24,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 7] total 17 [2022-11-18 18:33:24,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802882377] [2022-11-18 18:33:24,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:33:24,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 18:33:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:24,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 18:33:24,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=222, Unknown=12, NotChecked=0, Total=306 [2022-11-18 18:33:24,390 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 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-18 18:33:24,430 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (and (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse9 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_27))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (exists ((v_prenex_239 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_241 (Array Int Int)) (v_prenex_242 (Array Int Int)) (v_prenex_243 (Array Int Int)) (v_prenex_244 (Array Int Int))) (let ((.cse1 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_243) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_244) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_243) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_244)) (.cse2 (select v_prenex_244 0)) (.cse5 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_239) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_239) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_240))) (and (= .cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_240 0) .cse2) (= (select .cse1 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse3) (= .cse2 (select v_DerPreprocessor_27 0)) (= .cse2 .cse4) (= .cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= .cse2 0) (= .cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) (= .cse6 .cse3) (= (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| .cse4) 0 (select .cse8 0)) .cse8) (<= (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (= .cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~c~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) (<= (select .cse10 0) 0) (and (<= (select .cse6 0) 0) (<= (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647)) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (and (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse17 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_27))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse12 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse6 .cse11) (<= (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_1 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse15 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_19) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_21) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_19) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_21)) (.cse14 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_14)) (.cse16 (select (store (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_1) 0 v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse13 (select v_DerPreprocessor_14 0))) (and (= .cse13 (select v_prenex_21 0)) (<= .cse13 0) (= .cse0 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse13 (select v_DerPreprocessor_27 0)) (= (select .cse15 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse11) (= .cse11 (select .cse14 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse13 .cse16) (= v_DerPreprocessor_1 .cse16) (= (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0) .cse13)))) (= .cse0 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~c~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) (let ((.cse18 (select .cse0 0))) (and (<= .cse18 0) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_22 Int) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_21 Int)) (let ((.cse21 (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse20 (select (store (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_21) 0 v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (<= (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (= v_DerPreprocessor_21 .cse20) (= .cse20 .cse18) (= (select .cse21 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse6) (= .cse18 (select v_DerPreprocessor_20 0))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse24 (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse23 (select (store (store .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_1) 0 v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (<= (select .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (= .cse23 .cse18) (= (select .cse24 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse6) (= v_DerPreprocessor_1 .cse23) (= .cse18 (select v_DerPreprocessor_20 0)))))))))))) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (or (exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int)) (let ((.cse25 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select .cse6 |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1) .cse25) (<= .cse25 2147483647) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (and (exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0) 2147483647) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) (not |c_ULTIMATE.start_test_fun_#t~short10#1|))) (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from true [2022-11-18 18:33:24,455 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|))) (and (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (or (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (and (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse9 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_27))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse7 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (exists ((v_prenex_239 (Array Int Int)) (v_prenex_240 (Array Int Int)) (v_prenex_241 (Array Int Int)) (v_prenex_242 (Array Int Int)) (v_prenex_243 (Array Int Int)) (v_prenex_244 (Array Int Int))) (let ((.cse1 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_243) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_244) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_242) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_243) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_244)) (.cse2 (select v_prenex_244 0)) (.cse5 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_239) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_240) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_241) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_239) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_240))) (and (= .cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_prenex_240 0) .cse2) (= (select .cse1 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse3) (= .cse2 (select v_DerPreprocessor_27 0)) (= .cse2 .cse4) (= .cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (<= .cse2 0) (= .cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))) (= .cse6 .cse3) (= (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| .cse4) 0 (select .cse8 0)) .cse8) (<= (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (= .cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~c~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) (<= (select .cse10 0) 0) (and (<= (select .cse6 0) 0) (<= (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647)) (exists ((|ULTIMATE.start_test_fun_~c~0#1.base| Int)) (and (exists ((v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse17 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_26) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_27))) (let ((.cse11 (select .cse17 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (.cse12 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse6 .cse11) (<= (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (exists ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_1 Int) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse15 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_19) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_21) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_prenex_19) |ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_21)) (.cse14 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_14) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_13) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_14)) (.cse16 (select (store (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_1) 0 v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse13 (select v_DerPreprocessor_14 0))) (and (= .cse13 (select v_prenex_21 0)) (<= .cse13 0) (= .cse0 (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse0 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse13 (select v_DerPreprocessor_27 0)) (= (select .cse15 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse11) (= .cse11 (select .cse14 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (= .cse13 .cse16) (= v_DerPreprocessor_1 .cse16) (= (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) 0) .cse13)))) (= .cse0 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~c~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) (let ((.cse18 (select .cse0 0))) (and (<= .cse18 0) (or (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_22 Int) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_21 Int)) (let ((.cse21 (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse20 (select (store (store .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_21) 0 v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (<= (select .cse19 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (= v_DerPreprocessor_21 .cse20) (= .cse20 .cse18) (= (select .cse21 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse6) (= .cse18 (select v_DerPreprocessor_20 0))))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (let ((.cse24 (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse23 (select (store (store .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_DerPreprocessor_1) 0 v_DerPreprocessor_2) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (<= (select .cse22 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (= .cse23 .cse18) (= (select .cse24 |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|) .cse6) (= v_DerPreprocessor_1 .cse23) (= .cse18 (select v_DerPreprocessor_20 0)))))))))))) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int)) (let ((.cse25 (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0))) (and (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= (+ (select .cse6 |c_ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 1) .cse25) (<= .cse25 2147483647) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))))) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~z_ref~0#1.base|)) (not (= |c_ULTIMATE.start_test_fun_~z_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from true [2022-11-18 18:33:38,821 WARN L233 SmtUtils]: Spent 14.28s on a formula simplification. DAG size of input: 55 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:33:54,683 WARN L233 SmtUtils]: Spent 13.68s on a formula simplification. DAG size of input: 44 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:34:33,783 WARN L233 SmtUtils]: Spent 34.40s on a formula simplification. DAG size of input: 38 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:34:51,999 WARN L233 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 42 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:35:10,267 WARN L233 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 41 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 18:35:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:10,323 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-11-18 18:35:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 18:35:10,324 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-18 18:35:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:10,326 INFO L225 Difference]: With dead ends: 48 [2022-11-18 18:35:10,326 INFO L226 Difference]: Without dead ends: 47 [2022-11-18 18:35:10,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 113.1s TimeCoverageRelationStatistics Valid=197, Invalid=435, Unknown=26, NotChecked=98, Total=756 [2022-11-18 18:35:10,328 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:10,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 47 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-11-18 18:35:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-18 18:35:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2022-11-18 18:35:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-18 18:35:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-18 18:35:10,337 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2022-11-18 18:35:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:10,337 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-18 18:35:10,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 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-18 18:35:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-18 18:35:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 18:35:10,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:35:10,339 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1] [2022-11-18 18:35:10,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 18:35:10,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:35:10,540 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 18:35:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:35:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1247358070, now seen corresponding path program 2 times [2022-11-18 18:35:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:35:10,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468365080] [2022-11-18 18:35:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:35:10,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:35:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:35:13,047 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:13,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:35:13,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468365080] [2022-11-18 18:35:13,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468365080] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:35:13,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775396665] [2022-11-18 18:35:13,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:35:13,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:35:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:35:13,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:35:13,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 18:35:13,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:35:13,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:35:13,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-18 18:35:13,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:35:13,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-18 18:35:13,382 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-18 18:35:13,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1054 treesize of output 816 [2022-11-18 18:35:13,915 INFO L321 Elim1Store]: treesize reduction 244, result has 27.6 percent of original size [2022-11-18 18:35:13,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 808 treesize of output 742 [2022-11-18 18:35:13,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-18 18:35:14,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 18:35:14,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 18:35:14,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-18 18:35:14,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 62 [2022-11-18 18:35:14,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:14,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:14,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-18 18:35:14,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:35:16,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:16,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:16,655 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-18 18:35:16,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 79 [2022-11-18 18:35:16,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:35:16,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:35:16,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:35:16,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:16,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:16,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:16,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:16,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:16,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:16,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 39 [2022-11-18 18:35:16,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-11-18 18:35:16,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-18 18:35:16,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:35:17,684 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-18 18:35:17,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 394 treesize of output 347 [2022-11-18 18:35:18,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:18,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:18,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-18 18:35:18,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:35:18,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:18,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:18,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:18,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:18,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:18,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 65 [2022-11-18 18:35:18,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:18,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 18:35:18,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2022-11-18 18:35:18,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-18 18:35:18,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-18 18:35:18,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-18 18:35:23,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:23,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:23,816 INFO L321 Elim1Store]: treesize reduction 162, result has 34.7 percent of original size [2022-11-18 18:35:23,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 3962 treesize of output 3791 [2022-11-18 18:35:24,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-18 18:35:24,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-11-18 18:35:24,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 18:35:24,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-18 18:35:24,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-11-18 18:35:24,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 18:35:24,758 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:35:24,782 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-18 18:35:24,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-18 18:35:24,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-11-18 18:35:24,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 18:35:25,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-11-18 18:35:25,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 18:35:25,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 18:35:25,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-18 18:35:25,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 18:35:26,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 18:35:26,970 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 18:35:26,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-11-18 18:35:26,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-11-18 18:35:27,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2022-11-18 18:35:27,400 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 18:35:27,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2022-11-18 18:35:27,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2022-11-18 18:35:28,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 18:35:28,221 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 18:35:28,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 21 [2022-11-18 18:35:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 27 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:28,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:35:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:35:40,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775396665] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:35:40,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:35:40,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2022-11-18 18:35:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720114377] [2022-11-18 18:35:40,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:35:40,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-18 18:35:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:35:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-18 18:35:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1048, Unknown=33, NotChecked=0, Total=1332 [2022-11-18 18:35:40,148 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 37 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 37 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:35:47,579 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-11-18 18:35:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 18:35:47,580 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 37 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-18 18:35:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:35:47,580 INFO L225 Difference]: With dead ends: 44 [2022-11-18 18:35:47,580 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 18:35:47,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=720, Invalid=1940, Unknown=96, NotChecked=0, Total=2756 [2022-11-18 18:35:47,582 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 109 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:35:47,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 52 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 39 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-11-18 18:35:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 18:35:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 18:35:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 18:35:47,584 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-11-18 18:35:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:35:47,584 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 18:35:47,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.2222222222222223) internal successors, (80), 37 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:35:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 18:35:47,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 18:35:47,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-18 18:35:47,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-18 18:35:47,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-18 18:35:47,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-18 18:35:47,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 18:35:47,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:35:47,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 18:35:47,960 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2022-11-18 18:35:47,960 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 18:35:47,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2022-11-18 18:35:47,962 INFO L895 garLoopResultBuilder]: At program point L564(lines 563 565) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (or (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not .cse0)) (or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) .cse0))) [2022-11-18 18:35:47,962 INFO L899 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-11-18 18:35:47,963 INFO L899 garLoopResultBuilder]: For program point L558-1(line 558) no Hoare annotation was computed. [2022-11-18 18:35:47,963 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 18:35:47,963 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 558) no Hoare annotation was computed. [2022-11-18 18:35:47,963 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 559) no Hoare annotation was computed. [2022-11-18 18:35:47,963 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 18:35:47,964 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 18:35:47,964 INFO L895 garLoopResultBuilder]: At program point L561(lines 547 562) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (or (= |ULTIMATE.start_test_fun_~z_ref~0#1.offset| |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (not .cse0)) (or (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) .cse0))) [2022-11-18 18:35:47,964 INFO L899 garLoopResultBuilder]: For program point L559(line 559) no Hoare annotation was computed. [2022-11-18 18:35:47,964 INFO L899 garLoopResultBuilder]: For program point L559-1(line 559) no Hoare annotation was computed. [2022-11-18 18:35:47,964 INFO L899 garLoopResultBuilder]: For program point L557-1(line 557) no Hoare annotation was computed. [2022-11-18 18:35:47,964 INFO L899 garLoopResultBuilder]: For program point L557-3(lines 557 560) no Hoare annotation was computed. [2022-11-18 18:35:47,965 INFO L895 garLoopResultBuilder]: At program point L557-5(lines 557 560) the Hoare annotation is: (and (not (= |ULTIMATE.start_test_fun_~y_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (not (= |ULTIMATE.start_test_fun_~z_ref~0#1.base| |ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= |ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~z_ref~0#1.base|) |ULTIMATE.start_test_fun_~z_ref~0#1.offset|) 2147483648)) (<= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483647) (<= 0 (+ (select (select |#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483648))) [2022-11-18 18:35:47,965 INFO L899 garLoopResultBuilder]: For program point L557-6(lines 557 560) no Hoare annotation was computed. [2022-11-18 18:35:47,969 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-11-18 18:35:47,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:35:47,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:35:47 BoogieIcfgContainer [2022-11-18 18:35:47,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:35:47,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:35:47,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:35:47,995 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:35:47,996 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:02" (3/4) ... [2022-11-18 18:35:47,999 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 18:35:48,012 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-18 18:35:48,012 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-18 18:35:48,013 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 18:35:48,013 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 18:35:48,058 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 18:35:48,058 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:35:48,059 INFO L158 Benchmark]: Toolchain (without parser) took 166506.56ms. Allocated memory was 109.1MB in the beginning and 375.4MB in the end (delta: 266.3MB). Free memory was 67.2MB in the beginning and 318.5MB in the end (delta: -251.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-11-18 18:35:48,060 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:35:48,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.59ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 79.2MB in the end (delta: -12.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2022-11-18 18:35:48,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.97ms. Allocated memory is still 109.1MB. Free memory was 78.8MB in the beginning and 76.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:35:48,061 INFO L158 Benchmark]: Boogie Preprocessor took 55.49ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 75.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:35:48,061 INFO L158 Benchmark]: RCFGBuilder took 470.03ms. Allocated memory is still 109.1MB. Free memory was 75.6MB in the beginning and 63.3MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 18:35:48,062 INFO L158 Benchmark]: TraceAbstraction took 165297.46ms. Allocated memory was 109.1MB in the beginning and 375.4MB in the end (delta: 266.3MB). Free memory was 62.4MB in the beginning and 321.6MB in the end (delta: -259.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-11-18 18:35:48,062 INFO L158 Benchmark]: Witness Printer took 63.16ms. Allocated memory is still 375.4MB. Free memory was 321.6MB in the beginning and 318.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:35:48,066 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.59ms. Allocated memory is still 109.1MB. Free memory was 67.0MB in the beginning and 79.2MB in the end (delta: -12.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.97ms. Allocated memory is still 109.1MB. Free memory was 78.8MB in the beginning and 76.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.49ms. Allocated memory is still 109.1MB. Free memory was 76.9MB in the beginning and 75.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 470.03ms. Allocated memory is still 109.1MB. Free memory was 75.6MB in the beginning and 63.3MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 165297.46ms. Allocated memory was 109.1MB in the beginning and 375.4MB in the end (delta: 266.3MB). Free memory was 62.4MB in the beginning and 321.6MB in the end (delta: -259.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Witness Printer took 63.16ms. Allocated memory is still 375.4MB. Free memory was 321.6MB in the beginning and 318.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 559]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 165.2s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 114.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 77 IncrementalHoareTripleChecker+Unchecked, 132 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 36 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 133.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 8 NumberOfFragments, 84 HoareAnnotationTreeSize, 3 FomulaSimplifications, 159 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1950 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 49.3s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 152 ConstructedInterpolants, 44 QuantifiedInterpolants, 31087 SizeOfPredicates, 48 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 7/135 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant Derived loop invariant: (z_ref == x_ref || !(z_ref == x_ref)) && (unknown-#memory_int-unknown[x_ref][x_ref] <= 2147483647 || z_ref == x_ref) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: ((((((!(y_ref == x_ref) && x_ref == 0) && !(z_ref == y_ref)) && !(z_ref == x_ref)) && y_ref == 0) && 0 <= unknown-#memory_int-unknown[z_ref][z_ref] + 2147483648) && unknown-#memory_int-unknown[x_ref][x_ref] <= 2147483647) && 0 <= unknown-#memory_int-unknown[y_ref][y_ref] + 2147483648 - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (z_ref == x_ref || !(z_ref == x_ref)) && (unknown-#memory_int-unknown[x_ref][x_ref] <= 2147483647 || z_ref == x_ref) RESULT: Ultimate proved your program to be correct! [2022-11-18 18:35:48,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1694a624-a82f-49e1-8cbe-87d1623f2a39/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE