./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/eqn1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14bc2dbf7c29b1d0f6a0a1f7aa323adbc9855e56ce7f667c86a31ecee97dcbe0 --- 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-38b53e6 [2022-11-25 17:09:37,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:09:37,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:09:37,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:09:37,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:09:37,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:09:37,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:09:37,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:09:37,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:09:37,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:09:37,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:09:37,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:09:37,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:09:37,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:09:37,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:09:37,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:09:37,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:09:37,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:09:37,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:09:37,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:09:37,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:09:37,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:09:37,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:09:37,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:09:37,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:09:37,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:09:37,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:09:37,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:09:37,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:09:37,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:09:37,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:09:37,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:09:37,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:09:37,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:09:37,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:09:37,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:09:37,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:09:37,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:09:37,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:09:37,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:09:37,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:09:37,252 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:09:37,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:09:37,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:09:37,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:09:37,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:09:37,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:09:37,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:09:37,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:09:37,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:09:37,292 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:09:37,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:09:37,294 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:09:37,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:09:37,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:09:37,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:09:37,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:09:37,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:09:37,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:09:37,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:09:37,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:09:37,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:09:37,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:09:37,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:09:37,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:09:37,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:09:37,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:09:37,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:09:37,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:09:37,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:09:37,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:09:37,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:09:37,298 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:09:37,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:09:37,299 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:09:37,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:09:37,299 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/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_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14bc2dbf7c29b1d0f6a0a1f7aa323adbc9855e56ce7f667c86a31ecee97dcbe0 [2022-11-25 17:09:37,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:09:37,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:09:37,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:09:37,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:09:37,638 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:09:37,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/array-fpi/eqn1.c [2022-11-25 17:09:40,808 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:09:41,098 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:09:41,099 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/sv-benchmarks/c/array-fpi/eqn1.c [2022-11-25 17:09:41,110 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/data/c982c1699/c1e1646692ba4212961b3c8ca5153b19/FLAGf35d937c3 [2022-11-25 17:09:41,133 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/data/c982c1699/c1e1646692ba4212961b3c8ca5153b19 [2022-11-25 17:09:41,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:09:41,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:09:41,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:09:41,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:09:41,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:09:41,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566fd5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41, skipping insertion in model container [2022-11-25 17:09:41,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:09:41,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:09:41,387 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/sv-benchmarks/c/array-fpi/eqn1.c[587,600] [2022-11-25 17:09:41,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:09:41,441 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:09:41,460 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/sv-benchmarks/c/array-fpi/eqn1.c[587,600] [2022-11-25 17:09:41,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:09:41,492 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:09:41,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41 WrapperNode [2022-11-25 17:09:41,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:09:41,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:09:41,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:09:41,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:09:41,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,555 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-11-25 17:09:41,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:09:41,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:09:41,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:09:41,557 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:09:41,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,598 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:09:41,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:09:41,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:09:41,605 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:09:41,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (1/1) ... [2022-11-25 17:09:41,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:09:41,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:41,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:09:41,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:09:41,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:09:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:09:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:09:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:09:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:09:41,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:09:41,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:09:41,775 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:09:41,778 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:09:42,015 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:09:42,021 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:09:42,021 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 17:09:42,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:09:42 BoogieIcfgContainer [2022-11-25 17:09:42,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:09:42,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:09:42,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:09:42,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:09:42,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:09:41" (1/3) ... [2022-11-25 17:09:42,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b619ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:09:42, skipping insertion in model container [2022-11-25 17:09:42,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:09:41" (2/3) ... [2022-11-25 17:09:42,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b619ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:09:42, skipping insertion in model container [2022-11-25 17:09:42,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:09:42" (3/3) ... [2022-11-25 17:09:42,034 INFO L112 eAbstractionObserver]: Analyzing ICFG eqn1.c [2022-11-25 17:09:42,072 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:09:42,072 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:09:42,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:09:42,141 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;@75cc8792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:09:42,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:09:42,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 17:09:42,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:42,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:42,152 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:42,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:42,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1828546148, now seen corresponding path program 1 times [2022-11-25 17:09:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:42,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623812068] [2022-11-25 17:09:42,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:42,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:42,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:42,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623812068] [2022-11-25 17:09:42,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-25 17:09:42,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322473648] [2022-11-25 17:09:42,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:42,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:42,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:42,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:42,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:09:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:42,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:09:42,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:42,573 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-25 17:09:42,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:42,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322473648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:42,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:09:42,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:09:42,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093370270] [2022-11-25 17:09:42,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:42,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:09:42,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:42,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:09:42,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:09:42,634 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-25 17:09:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:42,655 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2022-11-25 17:09:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:09:42,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 17:09:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:42,672 INFO L225 Difference]: With dead ends: 38 [2022-11-25 17:09:42,672 INFO L226 Difference]: Without dead ends: 17 [2022-11-25 17:09:42,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:09:42,681 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:42,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:09:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-25 17:09:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-25 17:09:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) 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-25 17:09:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-25 17:09:42,720 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-11-25 17:09:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:42,721 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-25 17:09:42,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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-25 17:09:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-25 17:09:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 17:09:42,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:42,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:42,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:42,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-25 17:09:42,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:42,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1148487778, now seen corresponding path program 1 times [2022-11-25 17:09:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:42,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414621044] [2022-11-25 17:09:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:42,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:42,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:42,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606081085] [2022-11-25 17:09:42,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:42,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:42,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:42,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:42,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:09:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:43,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:09:43,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:43,248 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-25 17:09:43,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-11-25 17:09:43,279 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-25 17:09:43,313 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-25 17:09:43,417 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 5 treesize of output 3 [2022-11-25 17:09:43,504 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-25 17:09:43,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:43,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:43,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414621044] [2022-11-25 17:09:43,505 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:43,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606081085] [2022-11-25 17:09:43,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606081085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:43,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:09:43,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:09:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882207619] [2022-11-25 17:09:43,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:43,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:09:43,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:43,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:09:43,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:09:43,509 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-25 17:09:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:43,609 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-11-25 17:09:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:09:43,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 17:09:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:43,611 INFO L225 Difference]: With dead ends: 34 [2022-11-25 17:09:43,611 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 17:09:43,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:09:43,613 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:43,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 17:09:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-11-25 17:09:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-25 17:09:43,620 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-11-25 17:09:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:43,621 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-25 17:09:43,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-25 17:09:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-25 17:09:43,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:09:43,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:43,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:43,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:43,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:43,829 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:43,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:43,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1755224028, now seen corresponding path program 1 times [2022-11-25 17:09:43,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:43,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637068272] [2022-11-25 17:09:43,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:43,888 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:43,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092758641] [2022-11-25 17:09:43,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:43,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:43,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:43,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:43,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:09:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:43,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:09:43,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:44,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:44,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:44,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637068272] [2022-11-25 17:09:44,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:44,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092758641] [2022-11-25 17:09:44,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092758641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:44,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:09:44,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:09:44,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426240309] [2022-11-25 17:09:44,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:44,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:09:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:44,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:09:44,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:09:44,044 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:44,163 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-11-25 17:09:44,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:09:44,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 17:09:44,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:44,164 INFO L225 Difference]: With dead ends: 49 [2022-11-25 17:09:44,165 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 17:09:44,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:09:44,166 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:44,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 17:09:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2022-11-25 17:09:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-25 17:09:44,172 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-11-25 17:09:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:44,172 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-25 17:09:44,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-25 17:09:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:09:44,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:44,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:44,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:44,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:44,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1842440164, now seen corresponding path program 1 times [2022-11-25 17:09:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:44,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982412125] [2022-11-25 17:09:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:44,424 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:44,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1630069900] [2022-11-25 17:09:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:44,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:44,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:44,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:44,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:09:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:44,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 17:09:44,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:44,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:44,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:44,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982412125] [2022-11-25 17:09:44,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:44,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630069900] [2022-11-25 17:09:44,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630069900] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:44,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:09:44,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-11-25 17:09:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159337440] [2022-11-25 17:09:44,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:44,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:09:44,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:44,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:09:44,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:09:44,576 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:44,681 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-25 17:09:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:09:44,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-25 17:09:44,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:44,683 INFO L225 Difference]: With dead ends: 44 [2022-11-25 17:09:44,683 INFO L226 Difference]: Without dead ends: 37 [2022-11-25 17:09:44,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:09:44,684 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:44,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-25 17:09:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2022-11-25 17:09:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-25 17:09:44,691 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2022-11-25 17:09:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:44,691 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-25 17:09:44,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:44,692 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-25 17:09:44,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:09:44,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:44,693 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:44,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:44,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:44,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1667884396, now seen corresponding path program 1 times [2022-11-25 17:09:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:44,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110009935] [2022-11-25 17:09:44,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:44,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:44,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:44,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480050739] [2022-11-25 17:09:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:44,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:44,932 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:44,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:09:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:45,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:09:45,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:45,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:45,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:45,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110009935] [2022-11-25 17:09:45,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:45,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480050739] [2022-11-25 17:09:45,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480050739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:45,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:09:45,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:09:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696048158] [2022-11-25 17:09:45,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:45,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:09:45,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:45,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:09:45,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:09:45,063 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:45,184 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-11-25 17:09:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:09:45,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 17:09:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:45,185 INFO L225 Difference]: With dead ends: 41 [2022-11-25 17:09:45,186 INFO L226 Difference]: Without dead ends: 27 [2022-11-25 17:09:45,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:09:45,187 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:45,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-25 17:09:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2022-11-25 17:09:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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-25 17:09:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-25 17:09:45,191 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2022-11-25 17:09:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:45,192 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-25 17:09:45,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-25 17:09:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:09:45,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:45,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:45,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:45,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:45,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:45,400 INFO L85 PathProgramCache]: Analyzing trace with hash 586911962, now seen corresponding path program 1 times [2022-11-25 17:09:45,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:45,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889821460] [2022-11-25 17:09:45,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:45,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:45,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774457621] [2022-11-25 17:09:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:45,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:45,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:45,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:45,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:09:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:45,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 17:09:45,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:45,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:09:45,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:45,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 17:09:45,602 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-25 17:09:45,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:09:45,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 17:09:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:45,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:45,964 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_159 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) is different from false [2022-11-25 17:09:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 17:09:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:45,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889821460] [2022-11-25 17:09:45,997 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:45,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774457621] [2022-11-25 17:09:45,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774457621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:45,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:09:45,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-11-25 17:09:45,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071847263] [2022-11-25 17:09:45,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:45,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:09:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:45,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:09:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2022-11-25 17:09:45,999 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-25 17:09:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:46,437 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-11-25 17:09:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:09:46,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 17:09:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:46,438 INFO L225 Difference]: With dead ends: 54 [2022-11-25 17:09:46,439 INFO L226 Difference]: Without dead ends: 52 [2022-11-25 17:09:46,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=243, Unknown=1, NotChecked=34, Total=380 [2022-11-25 17:09:46,440 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:46,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 62 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-11-25 17:09:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-25 17:09:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 26. [2022-11-25 17:09:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-25 17:09:46,448 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2022-11-25 17:09:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:46,448 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-25 17:09:46,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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-25 17:09:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-25 17:09:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 17:09:46,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:46,449 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:46,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 17:09:46,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 17:09:46,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:46,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash 798963152, now seen corresponding path program 1 times [2022-11-25 17:09:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:46,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807818406] [2022-11-25 17:09:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:46,690 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1040037176] [2022-11-25 17:09:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:46,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:46,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:46,692 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:46,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:09:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:46,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 17:09:46,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:46,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:09:46,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:46,862 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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-25 17:09:46,869 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-25 17:09:46,874 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-25 17:09:46,881 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-25 17:09:46,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:46,949 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:09:46,949 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 17:09:47,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:47,032 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:09:47,033 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2022-11-25 17:09:47,329 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:09:47,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 32 [2022-11-25 17:09:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:47,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:48,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:48,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807818406] [2022-11-25 17:09:48,091 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:48,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040037176] [2022-11-25 17:09:48,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040037176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:48,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:09:48,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2022-11-25 17:09:48,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835809055] [2022-11-25 17:09:48,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:48,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 17:09:48,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:48,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 17:09:48,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:09:48,094 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:51,451 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2022-11-25 17:09:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 17:09:51,452 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 17:09:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:51,453 INFO L225 Difference]: With dead ends: 82 [2022-11-25 17:09:51,453 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 17:09:51,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 17:09:51,455 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 142 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:51,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 108 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:09:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 17:09:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 46. [2022-11-25 17:09:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-11-25 17:09:51,481 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 20 [2022-11-25 17:09:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:51,481 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-11-25 17:09:51,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-11-25 17:09:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 17:09:51,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:51,483 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:51,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:51,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:51,689 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1334592554, now seen corresponding path program 2 times [2022-11-25 17:09:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:51,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975471961] [2022-11-25 17:09:51,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:51,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:51,733 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:51,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950090987] [2022-11-25 17:09:51,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:09:51,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:51,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:51,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:51,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:09:51,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:09:51,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:09:51,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:09:51,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:09:51,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:09:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:51,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975471961] [2022-11-25 17:09:51,938 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:51,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950090987] [2022-11-25 17:09:51,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950090987] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:51,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:09:51,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-25 17:09:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440975344] [2022-11-25 17:09:51,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:51,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:09:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:51,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:09:51,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:09:51,941 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-25 17:09:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:52,099 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-11-25 17:09:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:09:52,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 20 [2022-11-25 17:09:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:52,100 INFO L225 Difference]: With dead ends: 103 [2022-11-25 17:09:52,100 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 17:09:52,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:09:52,102 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:52,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 59 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 17:09:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2022-11-25 17:09:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 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-25 17:09:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-11-25 17:09:52,121 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 20 [2022-11-25 17:09:52,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:52,121 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-11-25 17:09:52,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-25 17:09:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-11-25 17:09:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 17:09:52,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:52,123 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:52,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:52,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:52,330 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:52,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:52,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1146782124, now seen corresponding path program 3 times [2022-11-25 17:09:52,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:52,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020684462] [2022-11-25 17:09:52,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:52,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:52,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:52,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463920269] [2022-11-25 17:09:52,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:09:52,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:52,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:52,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:52,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:09:52,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 17:09:52,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:09:52,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:09:52,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:52,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:52,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:52,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020684462] [2022-11-25 17:09:52,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:52,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463920269] [2022-11-25 17:09:52,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463920269] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:52,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:09:52,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-25 17:09:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235619704] [2022-11-25 17:09:52,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:52,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 17:09:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 17:09:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:09:52,733 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:53,036 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2022-11-25 17:09:53,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 17:09:53,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 17:09:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:53,038 INFO L225 Difference]: With dead ends: 113 [2022-11-25 17:09:53,038 INFO L226 Difference]: Without dead ends: 81 [2022-11-25 17:09:53,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2022-11-25 17:09:53,039 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 146 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:53,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 65 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-25 17:09:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2022-11-25 17:09:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 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-25 17:09:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-25 17:09:53,051 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 22 [2022-11-25 17:09:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:53,051 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-25 17:09:53,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-25 17:09:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:09:53,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:53,053 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:53,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:53,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:53,257 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1083970380, now seen corresponding path program 2 times [2022-11-25 17:09:53,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:53,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987767310] [2022-11-25 17:09:53,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:53,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:53,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:53,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699564610] [2022-11-25 17:09:53,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:09:53,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:53,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:53,302 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:53,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:09:53,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:09:53,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:09:53,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:09:53,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:09:53,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:09:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:53,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987767310] [2022-11-25 17:09:53,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:53,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699564610] [2022-11-25 17:09:53,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699564610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:53,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:09:53,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-25 17:09:53,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529076183] [2022-11-25 17:09:53,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:53,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:09:53,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:53,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:09:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:09:53,513 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:53,649 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-11-25 17:09:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:09:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 17:09:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:53,649 INFO L225 Difference]: With dead ends: 64 [2022-11-25 17:09:53,650 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 17:09:53,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:09:53,651 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:53,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 39 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 17:09:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2022-11-25 17:09:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-25 17:09:53,660 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 24 [2022-11-25 17:09:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:53,661 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-25 17:09:53,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-25 17:09:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:09:53,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:53,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:53,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:53,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:09:53,867 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1049585326, now seen corresponding path program 4 times [2022-11-25 17:09:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:53,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691245384] [2022-11-25 17:09:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:53,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:53,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:53,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800748196] [2022-11-25 17:09:53,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:09:53,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:53,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:53,893 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:53,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:09:54,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:09:54,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:09:54,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 17:09:54,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:54,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:09:54,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-25 17:09:54,491 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-25 17:09:54,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:09:54,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:09:54,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 17:09:54,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2022-11-25 17:09:54,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-11-25 17:09:54,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 24 [2022-11-25 17:09:54,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2022-11-25 17:09:54,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-11-25 17:09:54,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 17 [2022-11-25 17:09:54,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:54,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 17:09:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:54,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:09:55,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:55,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691245384] [2022-11-25 17:09:55,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:55,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800748196] [2022-11-25 17:09:55,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800748196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:55,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:09:55,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-25 17:09:55,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588866733] [2022-11-25 17:09:55,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:55,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 17:09:55,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:55,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 17:09:55,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=276, Unknown=3, NotChecked=0, Total=380 [2022-11-25 17:09:55,639 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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-25 17:09:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:56,971 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-11-25 17:09:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-25 17:09:56,972 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 17:09:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:56,974 INFO L225 Difference]: With dead ends: 114 [2022-11-25 17:09:56,974 INFO L226 Difference]: Without dead ends: 112 [2022-11-25 17:09:56,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=311, Invalid=808, Unknown=3, NotChecked=0, Total=1122 [2022-11-25 17:09:56,975 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 296 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:56,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 140 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:09:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-25 17:09:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 49. [2022-11-25 17:09:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 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-25 17:09:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-11-25 17:09:56,989 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 24 [2022-11-25 17:09:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:56,989 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-11-25 17:09:56,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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-25 17:09:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-11-25 17:09:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:09:56,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:56,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:57,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:57,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 17:09:57,198 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:57,198 INFO L85 PathProgramCache]: Analyzing trace with hash 149788298, now seen corresponding path program 3 times [2022-11-25 17:09:57,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:57,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180984341] [2022-11-25 17:09:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:57,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:57,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866338353] [2022-11-25 17:09:57,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:09:57,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:57,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:57,220 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:57,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:09:57,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 17:09:57,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:09:57,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:09:57,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:09:57,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:09:57,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:57,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180984341] [2022-11-25 17:09:57,595 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:09:57,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866338353] [2022-11-25 17:09:57,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866338353] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:57,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:09:57,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-25 17:09:57,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337204391] [2022-11-25 17:09:57,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:57,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 17:09:57,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:57,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 17:09:57,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-25 17:09:57,598 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:57,891 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-11-25 17:09:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 17:09:57,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 17:09:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:57,892 INFO L225 Difference]: With dead ends: 84 [2022-11-25 17:09:57,892 INFO L226 Difference]: Without dead ends: 75 [2022-11-25 17:09:57,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:09:57,893 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 58 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:57,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 75 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:09:57,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-25 17:09:57,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2022-11-25 17:09:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-11-25 17:09:57,905 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 26 [2022-11-25 17:09:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:57,906 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-11-25 17:09:57,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:09:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-11-25 17:09:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 17:09:57,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:57,907 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:57,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:58,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:58,113 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:58,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:58,113 INFO L85 PathProgramCache]: Analyzing trace with hash -55017726, now seen corresponding path program 4 times [2022-11-25 17:09:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:58,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386172216] [2022-11-25 17:09:58,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:58,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:58,146 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:09:58,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843331030] [2022-11-25 17:09:58,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:09:58,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:58,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:58,148 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:58,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:09:58,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:09:58,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:09:58,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 17:09:58,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:58,507 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-25 17:09:58,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-25 17:09:58,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-11-25 17:09:58,548 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-11-25 17:09:58,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 68 [2022-11-25 17:09:58,575 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-25 17:09:58,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-25 17:09:58,601 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 5 treesize of output 3 [2022-11-25 17:09:58,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 51 [2022-11-25 17:09:58,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:09:58,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:09:58,666 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-25 17:09:58,701 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 5 treesize of output 3 [2022-11-25 17:09:58,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:09:58,823 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:09:58,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 109 [2022-11-25 17:09:58,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:09:58,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:58,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:58,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:58,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2022-11-25 17:09:58,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:58,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 37 [2022-11-25 17:09:58,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:58,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:58,970 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:09:58,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 44 [2022-11-25 17:09:59,107 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:09:59,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 159 [2022-11-25 17:09:59,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:09:59,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:59,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:59,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:59,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:59,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 197 [2022-11-25 17:09:59,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:59,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:59,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:09:59,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:09:59,358 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-25 17:09:59,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 58 [2022-11-25 17:09:59,764 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-11-25 17:09:59,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 43 [2022-11-25 17:09:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:09:59,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:10:15,041 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 139 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:10:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:15,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:15,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386172216] [2022-11-25 17:10:15,058 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:10:15,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843331030] [2022-11-25 17:10:15,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843331030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:10:15,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:10:15,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2022-11-25 17:10:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140475176] [2022-11-25 17:10:15,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:10:15,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-25 17:10:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:15,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-25 17:10:15,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=501, Unknown=1, NotChecked=0, Total=600 [2022-11-25 17:10:15,060 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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-25 17:10:33,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2022-11-25 17:10:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:10:41,369 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2022-11-25 17:10:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 17:10:41,369 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 28 [2022-11-25 17:10:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:10:41,370 INFO L225 Difference]: With dead ends: 128 [2022-11-25 17:10:41,370 INFO L226 Difference]: Without dead ends: 126 [2022-11-25 17:10:41,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 31.9s TimeCoverageRelationStatistics Valid=449, Invalid=1902, Unknown=1, NotChecked=0, Total=2352 [2022-11-25 17:10:41,372 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 247 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:10:41,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 186 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-11-25 17:10:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-25 17:10:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 78. [2022-11-25 17:10:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 77 states have internal predecessors, (92), 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-25 17:10:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2022-11-25 17:10:41,399 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 28 [2022-11-25 17:10:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:10:41,399 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2022-11-25 17:10:41,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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-25 17:10:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2022-11-25 17:10:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:10:41,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:10:41,400 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:41,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:10:41,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:10:41,607 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:10:41,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash -412561416, now seen corresponding path program 5 times [2022-11-25 17:10:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:41,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263895129] [2022-11-25 17:10:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:41,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:10:41,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [433490298] [2022-11-25 17:10:41,642 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:10:41,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:10:41,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:10:41,644 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:10:41,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:10:47,904 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-25 17:10:47,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:10:47,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 17:10:47,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:10:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:10:48,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:10:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:10:48,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:48,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263895129] [2022-11-25 17:10:48,161 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:10:48,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433490298] [2022-11-25 17:10:48,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433490298] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:10:48,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:10:48,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-11-25 17:10:48,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143197281] [2022-11-25 17:10:48,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:10:48,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:10:48,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:48,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:10:48,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:10:48,163 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-25 17:10:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:10:48,403 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-11-25 17:10:48,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:10:48,404 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 32 [2022-11-25 17:10:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:10:48,404 INFO L225 Difference]: With dead ends: 118 [2022-11-25 17:10:48,404 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 17:10:48,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:10:48,405 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:10:48,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 74 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:10:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 17:10:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2022-11-25 17:10:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 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-25 17:10:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2022-11-25 17:10:48,443 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 32 [2022-11-25 17:10:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:10:48,443 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2022-11-25 17:10:48,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-25 17:10:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2022-11-25 17:10:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:10:48,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:10:48,444 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:48,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:10:48,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:10:48,653 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:10:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1680698556, now seen corresponding path program 6 times [2022-11-25 17:10:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:48,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977703225] [2022-11-25 17:10:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:48,677 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:10:48,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423035775] [2022-11-25 17:10:48,677 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:10:48,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:10:48,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:10:48,680 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:10:48,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 17:10:49,189 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-25 17:10:49,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:10:49,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 17:10:49,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:10:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:10:49,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:10:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:10:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:49,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977703225] [2022-11-25 17:10:49,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:10:49,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423035775] [2022-11-25 17:10:49,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423035775] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:10:49,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:10:49,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-11-25 17:10:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914680611] [2022-11-25 17:10:49,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:10:49,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:10:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:49,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:10:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:10:49,439 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:10:50,050 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2022-11-25 17:10:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 17:10:50,050 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 17:10:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:10:50,051 INFO L225 Difference]: With dead ends: 195 [2022-11-25 17:10:50,051 INFO L226 Difference]: Without dead ends: 159 [2022-11-25 17:10:50,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=372, Invalid=1110, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 17:10:50,053 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 295 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:10:50,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 135 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:10:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-25 17:10:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 95. [2022-11-25 17:10:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.127659574468085) internal successors, (106), 94 states have internal predecessors, (106), 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-25 17:10:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2022-11-25 17:10:50,088 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 32 [2022-11-25 17:10:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:10:50,089 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2022-11-25 17:10:50,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2022-11-25 17:10:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:10:50,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:10:50,090 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:50,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:10:50,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 17:10:50,293 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:10:50,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:50,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1021371332, now seen corresponding path program 7 times [2022-11-25 17:10:50,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:50,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045894354] [2022-11-25 17:10:50,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:50,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:50,312 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:10:50,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969365088] [2022-11-25 17:10:50,312 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 17:10:50,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:10:50,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:10:50,314 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:10:50,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 17:10:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:50,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 17:10:50,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:10:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:10:50,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:10:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:10:50,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:50,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045894354] [2022-11-25 17:10:50,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:10:50,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969365088] [2022-11-25 17:10:50,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969365088] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:10:50,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:10:50,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2022-11-25 17:10:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822533854] [2022-11-25 17:10:50,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:10:50,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 17:10:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 17:10:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-11-25 17:10:50,674 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:10:51,512 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2022-11-25 17:10:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-25 17:10:51,513 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 17:10:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:10:51,513 INFO L225 Difference]: With dead ends: 168 [2022-11-25 17:10:51,514 INFO L226 Difference]: Without dead ends: 133 [2022-11-25 17:10:51,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=438, Invalid=1368, Unknown=0, NotChecked=0, Total=1806 [2022-11-25 17:10:51,515 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 149 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:10:51,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 276 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:10:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-25 17:10:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 84. [2022-11-25 17:10:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 83 states have internal predecessors, (90), 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-25 17:10:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-25 17:10:51,546 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 32 [2022-11-25 17:10:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:10:51,547 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-25 17:10:51,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-25 17:10:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:10:51,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:10:51,548 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:51,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:10:51,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 17:10:51,754 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:10:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:51,754 INFO L85 PathProgramCache]: Analyzing trace with hash -831401164, now seen corresponding path program 8 times [2022-11-25 17:10:51,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:51,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610391934] [2022-11-25 17:10:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:51,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:51,775 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:10:51,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340379561] [2022-11-25 17:10:51,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:10:51,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:10:51,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:10:51,777 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:10:51,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 17:10:52,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:10:52,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:10:52,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-25 17:10:52,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:10:52,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:10:52,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,463 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 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-25 17:10:52,467 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-11-25 17:10:52,471 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-25 17:10:52,478 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-25 17:10:52,540 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:10:52,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 109 [2022-11-25 17:10:52,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:10:52,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2022-11-25 17:10:52,593 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 17:10:52,735 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:10:52,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 163 [2022-11-25 17:10:52,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 201 [2022-11-25 17:10:52,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 93 [2022-11-25 17:10:52,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:52,940 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:10:52,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 56 [2022-11-25 17:10:53,107 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:10:53,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 168 treesize of output 150 [2022-11-25 17:10:53,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:10:53,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 197 [2022-11-25 17:10:53,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 118 [2022-11-25 17:10:53,370 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:10:53,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 193 [2022-11-25 17:10:53,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 240 [2022-11-25 17:10:53,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:10:53,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:10:53,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:10:53,734 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-25 17:10:53,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 84 [2022-11-25 17:10:54,771 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-25 17:10:54,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 135 treesize of output 63 [2022-11-25 17:10:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:54,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:11:38,617 WARN L233 SmtUtils]: Spent 14.90s on a formula simplification. DAG size of input: 172 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:12:53,998 WARN L233 SmtUtils]: Spent 40.98s on a formula simplification. DAG size of input: 188 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:12:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:12:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:54,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610391934] [2022-11-25 17:12:54,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:12:54,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340379561] [2022-11-25 17:12:54,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340379561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:12:54,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:12:54,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-11-25 17:12:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895207091] [2022-11-25 17:12:54,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:12:54,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-25 17:12:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:54,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-25 17:12:54,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1203, Unknown=13, NotChecked=0, Total=1406 [2022-11-25 17:12:54,019 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 38 states have internal predecessors, (67), 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-25 17:12:58,061 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse153 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse154 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse151 (* 8 .cse153))) (let ((.cse64 (select .cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse151))) (.cse152 (* .cse154 8)) (.cse155 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse156 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse36 (<= .cse156 2147483647)) (.cse149 (* .cse156 8)) (.cse148 (* 8 .cse155)) (.cse53 (<= .cse155 2147483647)) (.cse0 (<= .cse154 2147483647)) (.cse74 (<= .cse153 2147483647)) (.cse25 (+ .cse152 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse150 (+ 2 .cse64)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (+ .cse152 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse73 (select .cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) .cse151)))) (let ((.cse72 (store .cse13 .cse15 (+ .cse73 2))) (.cse75 (select .cse13 .cse9)) (.cse44 (store .cse13 .cse25 .cse150)) (.cse34 (store .cse13 .cse15 .cse150)) (.cse26 (not .cse74)) (.cse17 (not .cse0)) (.cse1 (not .cse53)) (.cse61 (+ .cse148 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse62 (+ .cse149 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse63 (not .cse36)) (.cse7 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse14 (+ .cse149 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse16 (+ .cse148 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or .cse0 (and .cse1 (forall ((v_ArrVal_680 Int)) (= (let ((.cse12 (store (store .cse13 .cse14 (+ 2 (select .cse13 .cse15))) .cse16 v_ArrVal_680))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12))) (let ((.cse10 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (store .cse10 .cse11 (+ .cse2 .cse3)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse2 .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 .cse7 (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13)))) (or .cse17 (forall ((v_ArrVal_680 Int)) (= (let ((.cse24 (store .cse13 .cse25 v_ArrVal_680))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse18 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse22 (store .cse23 .cse11 (+ .cse18 .cse19)))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| .cse22) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse18 .cse19 .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse22 .cse7 (+ .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13))) (or .cse26 (let ((.cse35 (+ 4 .cse64))) (and (or (forall ((v_ArrVal_680 Int)) (= (let ((.cse33 (store (store .cse34 .cse14 .cse35) .cse16 v_ArrVal_680))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33))) (let ((.cse32 (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse27 (select .cse32 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse28 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (store .cse32 .cse11 (+ .cse27 .cse28)))) (let ((.cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| .cse31) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse27 .cse28 .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse31 .cse7 (+ .cse27 .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13)) .cse0) (or (and (or .cse36 (forall ((v_ArrVal_680 Int)) (= (let ((.cse43 (store (store .cse44 .cse14 .cse35) .cse16 v_ArrVal_680))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43))) (let ((.cse42 (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse40 (select .cse42 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse39 (store .cse42 .cse11 (+ .cse40 .cse41)))) (let ((.cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~b~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse37 (select (select (store .cse38 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse39 .cse7 (+ .cse37 .cse40 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse40 .cse41))))))) 13))) (or (let ((.cse52 (store .cse44 .cse62 .cse35))) (and (or (forall ((v_ArrVal_680 Int)) (= 13 (let ((.cse51 (store .cse52 .cse16 v_ArrVal_680))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51))) (let ((.cse50 (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse46 (select .cse50 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse49 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse48 (store .cse50 .cse11 (+ .cse46 .cse49)))) (let ((.cse45 (select (select (store .cse47 |c_ULTIMATE.start_main_~b~0#1.base| .cse48) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse45 .cse46 (select (select (store .cse47 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse48 .cse7 (+ .cse45 .cse46 .cse49))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse49))))))))) .cse53) (or .cse1 (forall ((v_ArrVal_680 Int)) (= (let ((.cse60 (store .cse52 .cse61 v_ArrVal_680))) (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse60))) (let ((.cse59 (select .cse55 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse54 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse57 (select .cse59 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse56 (store .cse59 .cse11 (+ .cse54 .cse57)))) (let ((.cse58 (select (select (store .cse55 |c_ULTIMATE.start_main_~b~0#1.base| .cse56) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse54 (select (select (store .cse55 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse56 .cse7 (+ .cse54 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse57 .cse58))))))) 13))))) .cse63)) .cse17)))) (or (and .cse1 (forall ((v_ArrVal_680 Int)) (= (let ((.cse71 (store (store .cse72 .cse14 (+ .cse73 4)) .cse16 v_ArrVal_680))) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse71))) (let ((.cse70 (select .cse67 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse65 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse69 (select .cse70 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse68 (store .cse70 .cse11 (+ .cse65 .cse69)))) (let ((.cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~b~0#1.base| .cse68) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse65 .cse66 (select (select (store .cse67 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse68 .cse7 (+ .cse65 .cse66 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse69))))))) 13))) .cse74) (= (select .cse13 .cse8) (+ .cse75 2)) (or (forall ((v_ArrVal_680 Int)) (= (let ((.cse82 (store .cse13 .cse62 v_ArrVal_680))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse82))) (let ((.cse81 (select .cse79 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse76 (select .cse82 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse77 (select .cse81 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse80 (store .cse81 .cse11 (+ .cse76 .cse77)))) (let ((.cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~b~0#1.base| .cse80) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse76 .cse77 .cse78 (select (select (store .cse79 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse80 .cse7 (+ .cse76 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13)) .cse63) (or .cse74 (and .cse63 (forall ((v_ArrVal_680 Int)) (= (let ((.cse89 (store .cse72 .cse14 v_ArrVal_680))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse89))) (let ((.cse88 (select .cse84 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse83 (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse87 (select .cse88 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse85 (store .cse88 .cse11 (+ .cse83 .cse87)))) (let ((.cse86 (select (select (store .cse84 |c_ULTIMATE.start_main_~b~0#1.base| .cse85) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse83 (select (select (store .cse84 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse85 .cse7 (+ .cse83 .cse86 .cse87))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse86 .cse87))))))) 13)))) (or .cse36 (forall ((v_ArrVal_680 Int)) (= (let ((.cse96 (store .cse13 .cse14 v_ArrVal_680))) (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse96))) (let ((.cse95 (select .cse92 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse90 (select .cse96 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse91 (select .cse95 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse93 (store .cse95 .cse11 (+ .cse90 .cse91)))) (let ((.cse94 (select (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| .cse93) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse90 .cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse93 .cse7 (+ .cse90 .cse91 .cse94))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse94))))))) 13))) (= .cse75 4) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (or .cse0 (forall ((v_ArrVal_680 Int)) (= 13 (let ((.cse103 (store .cse13 .cse15 v_ArrVal_680))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse103))) (let ((.cse102 (select .cse99 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse97 (select .cse102 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse98 (select .cse103 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse100 (store .cse102 .cse11 (+ .cse97 .cse98)))) (let ((.cse101 (select (select (store .cse99 |c_ULTIMATE.start_main_~b~0#1.base| .cse100) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse97 .cse98 (select (select (store .cse99 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse100 .cse7 (+ .cse97 .cse98 .cse101))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse101)))))))))) (or (and (or .cse17 (and (or .cse63 (forall ((v_ArrVal_680 Int)) (= (let ((.cse110 (store .cse44 .cse62 v_ArrVal_680))) (let ((.cse107 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse110))) (let ((.cse109 (select .cse107 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse104 (select .cse109 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse105 (select .cse110 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse108 (store .cse109 .cse11 (+ .cse104 .cse105)))) (let ((.cse106 (select (select (store .cse107 |c_ULTIMATE.start_main_~b~0#1.base| .cse108) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse104 .cse105 .cse106 (select (select (store .cse107 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse108 .cse7 (+ .cse104 .cse105 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13))) (or .cse36 (forall ((v_ArrVal_680 Int)) (= 13 (let ((.cse117 (store .cse44 .cse14 v_ArrVal_680))) (let ((.cse113 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse117))) (let ((.cse116 (select .cse113 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse111 (select .cse116 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse115 (select .cse117 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse114 (store .cse116 .cse11 (+ .cse111 .cse115)))) (let ((.cse112 (select (select (store .cse113 |c_ULTIMATE.start_main_~b~0#1.base| .cse114) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse111 .cse112 (select (select (store .cse113 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse114 .cse7 (+ .cse111 .cse112 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse115)))))))))))) (or (forall ((v_ArrVal_680 Int)) (= (let ((.cse124 (store .cse34 .cse14 v_ArrVal_680))) (let ((.cse119 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse124))) (let ((.cse123 (select .cse119 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse118 (select .cse124 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse122 (select .cse123 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse120 (store .cse123 .cse11 (+ .cse118 .cse122)))) (let ((.cse121 (select (select (store .cse119 |c_ULTIMATE.start_main_~b~0#1.base| .cse120) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse118 (select (select (store .cse119 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse120 .cse7 (+ .cse118 .cse121 .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse121 .cse122))))))) 13)) .cse0)) .cse26) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (or .cse17 (let ((.cse140 (+ 2 (select .cse13 .cse25)))) (and (or (let ((.cse132 (store .cse13 .cse62 .cse140))) (and (or .cse1 (forall ((v_ArrVal_680 Int)) (= (let ((.cse131 (store .cse132 .cse61 v_ArrVal_680))) (let ((.cse128 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse131))) (let ((.cse130 (select .cse128 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse126 (select .cse131 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse127 (select .cse130 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse129 (store .cse130 .cse11 (+ .cse126 .cse127)))) (let ((.cse125 (select (select (store .cse128 |c_ULTIMATE.start_main_~b~0#1.base| .cse129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse125 .cse126 .cse127 (select (select (store .cse128 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse129 .cse7 (+ .cse125 .cse126 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13))) (or (forall ((v_ArrVal_680 Int)) (= 13 (let ((.cse139 (store .cse132 .cse16 v_ArrVal_680))) (let ((.cse136 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse139))) (let ((.cse138 (select .cse136 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse134 (select .cse138 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse135 (select .cse139 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse137 (store .cse138 .cse11 (+ .cse134 .cse135)))) (let ((.cse133 (select (select (store .cse136 |c_ULTIMATE.start_main_~b~0#1.base| .cse137) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse133 .cse134 .cse135 (select (select (store .cse136 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse137 .cse7 (+ .cse133 .cse134 .cse135))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))) .cse53))) .cse63) (or .cse36 (forall ((v_ArrVal_680 Int)) (= (let ((.cse147 (store (store .cse13 .cse14 .cse140) .cse16 v_ArrVal_680))) (let ((.cse141 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse147))) (let ((.cse146 (select .cse141 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse143 (select .cse147 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse144 (select .cse146 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse142 (store .cse146 .cse11 (+ .cse143 .cse144)))) (let ((.cse145 (select (select (store .cse141 |c_ULTIMATE.start_main_~b~0#1.base| .cse142) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ (select (select (store .cse141 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse142 .cse7 (+ .cse143 .cse144 .cse145))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse143 .cse144 .cse145))))))) 13)))))))))))) is different from true [2022-11-25 17:13:24,458 WARN L233 SmtUtils]: Spent 18.12s on a formula simplification. DAG size of input: 167 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:13:26,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:13:28,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:13:30,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:05,597 WARN L233 SmtUtils]: Spent 17.48s on a formula simplification. DAG size of input: 168 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:14:07,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:10,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:12,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:14,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:16,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:18,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:50,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:52,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:54,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:56,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:14:58,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:01,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:02,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:04,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:05,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:07,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:09,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:12,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:14,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:16,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:18,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:21,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:23,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:24,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:27,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:30,044 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse172 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse170 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse162 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse167 (* 8 .cse170)) (.cse168 (* .cse172 8))) (let ((.cse169 (+ .cse168 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse138 (select .cse162 (+ .cse167 |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse67 (select .cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse167))) (.cse173 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse164 (* .cse173 8)) (.cse105 (store .cse162 .cse169 (+ .cse138 .cse67))) (.cse25 (+ .cse168 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse171 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse7 (+ 16 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse90 (+ 24 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse27 (select .cse162 .cse7)) (.cse39 (<= .cse173 2147483647)) (.cse56 (<= .cse171 2147483647)) (.cse0 (<= .cse172 2147483647)) (.cse137 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse105) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25)) (.cse163 (* 8 .cse171)) (.cse77 (<= .cse170 2147483647)) (.cse166 (+ 2 .cse67)) (.cse9 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse165 (+ .cse164 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse88 (select .cse162 .cse169)) (.cse89 (select .cse13 .cse25)) (.cse15 (+ .cse168 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse76 (select .cse13 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) .cse167)))) (let ((.cse75 (store .cse13 .cse15 (+ .cse76 2))) (.cse86 (store .cse162 .cse165 (+ .cse88 .cse89))) (.cse78 (select .cse13 .cse9)) (.cse107 (select .cse162 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse47 (store .cse13 .cse25 .cse166)) (.cse37 (store .cse13 .cse15 .cse166)) (.cse29 (not .cse77)) (.cse87 (+ .cse163 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse115 (store .cse105 .cse165 (+ .cse137 .cse138 .cse67))) (.cse17 (not .cse0)) (.cse1 (not .cse56)) (.cse64 (+ .cse163 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse65 (+ .cse164 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse66 (not .cse39)) (.cse8 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (+ .cse164 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse16 (+ .cse163 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse106 (* .cse27 2)) (.cse26 (select .cse162 .cse90)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (and (or .cse0 (and .cse1 (forall ((v_ArrVal_680 Int)) (= (let ((.cse12 (store (store .cse13 .cse14 (+ 2 (select .cse13 .cse15))) .cse16 v_ArrVal_680))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12))) (let ((.cse10 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (store .cse10 .cse11 (+ .cse2 .cse3)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse2 .cse3 .cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse6 .cse7 (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13)))) (or .cse17 (forall ((v_ArrVal_680 Int)) (= (let ((.cse24 (store .cse13 .cse25 v_ArrVal_680))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24))) (let ((.cse23 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse18 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse22 (store .cse23 .cse11 (+ .cse18 .cse19)))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| .cse22) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse18 .cse19 .cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse22 .cse7 (+ .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13))) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse28 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse26 (+ .cse27 2 (select .cse28 8))) (= 2 (select .cse28 0)) (= .cse26 (+ .cse27 (select .cse28 16)))))) (or .cse29 (let ((.cse38 (+ 4 .cse67))) (and (or (forall ((v_ArrVal_680 Int)) (= (let ((.cse36 (store (store .cse37 .cse14 .cse38) .cse16 v_ArrVal_680))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse30 (select .cse35 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse31 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse34 (store .cse35 .cse11 (+ .cse30 .cse31)))) (let ((.cse32 (select (select (store .cse33 |c_ULTIMATE.start_main_~b~0#1.base| .cse34) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse30 .cse31 .cse32 (select (select (store .cse33 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse34 .cse7 (+ .cse30 .cse31 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13)) .cse0) (or (and (or .cse39 (forall ((v_ArrVal_680 Int)) (= (let ((.cse46 (store (store .cse47 .cse14 .cse38) .cse16 v_ArrVal_680))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse45 (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse43 (select .cse45 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse44 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse42 (store .cse45 .cse11 (+ .cse43 .cse44)))) (let ((.cse40 (select (select (store .cse41 |c_ULTIMATE.start_main_~b~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse40 (select (select (store .cse41 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse42 .cse7 (+ .cse40 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse43 .cse44))))))) 13))) (or (let ((.cse55 (store .cse47 .cse65 .cse38))) (and (or (forall ((v_ArrVal_680 Int)) (= 13 (let ((.cse54 (store .cse55 .cse16 v_ArrVal_680))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse54))) (let ((.cse53 (select .cse50 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse49 (select .cse53 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse52 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse51 (store .cse53 .cse11 (+ .cse49 .cse52)))) (let ((.cse48 (select (select (store .cse50 |c_ULTIMATE.start_main_~b~0#1.base| .cse51) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse48 .cse49 (select (select (store .cse50 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse51 .cse7 (+ .cse48 .cse49 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse52))))))))) .cse56) (or .cse1 (forall ((v_ArrVal_680 Int)) (= (let ((.cse63 (store .cse55 .cse64 v_ArrVal_680))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse63))) (let ((.cse62 (select .cse58 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse57 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse60 (select .cse62 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse59 (store .cse62 .cse11 (+ .cse57 .cse60)))) (let ((.cse61 (select (select (store .cse58 |c_ULTIMATE.start_main_~b~0#1.base| .cse59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse57 (select (select (store .cse58 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse59 .cse7 (+ .cse57 .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse60 .cse61))))))) 13))))) .cse66)) .cse17)))) (or (and .cse1 (forall ((v_ArrVal_680 Int)) (= (let ((.cse74 (store (store .cse75 .cse14 (+ .cse76 4)) .cse16 v_ArrVal_680))) (let ((.cse70 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse74))) (let ((.cse73 (select .cse70 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse68 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse72 (select .cse73 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse71 (store .cse73 .cse11 (+ .cse68 .cse72)))) (let ((.cse69 (select (select (store .cse70 |c_ULTIMATE.start_main_~b~0#1.base| .cse71) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse68 .cse69 (select (select (store .cse70 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse71 .cse7 (+ .cse68 .cse69 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse72))))))) 13))) .cse77) (= (select .cse13 .cse8) (+ .cse78 2)) (or (forall ((v_ArrVal_680 Int)) (= (let ((.cse85 (store .cse13 .cse65 v_ArrVal_680))) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse85))) (let ((.cse84 (select .cse82 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse79 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse80 (select .cse84 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse83 (store .cse84 .cse11 (+ .cse79 .cse80)))) (let ((.cse81 (select (select (store .cse82 |c_ULTIMATE.start_main_~b~0#1.base| .cse83) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse79 .cse80 .cse81 (select (select (store .cse82 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse83 .cse7 (+ .cse79 .cse80 .cse81))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13)) .cse66) (= (+ .cse27 6) .cse26) (= 13 (select (store .cse86 .cse87 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse86) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65) .cse88 .cse89)) .cse90)) (or .cse77 (and .cse66 (forall ((v_ArrVal_680 Int)) (= (let ((.cse97 (store .cse75 .cse14 v_ArrVal_680))) (let ((.cse92 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse97))) (let ((.cse96 (select .cse92 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse91 (select .cse97 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse95 (select .cse96 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse93 (store .cse96 .cse11 (+ .cse91 .cse95)))) (let ((.cse94 (select (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| .cse93) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse91 (select (select (store .cse92 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse93 .cse7 (+ .cse91 .cse94 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse94 .cse95))))))) 13)))) (or .cse39 (forall ((v_ArrVal_680 Int)) (= (let ((.cse104 (store .cse13 .cse14 v_ArrVal_680))) (let ((.cse100 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse104))) (let ((.cse103 (select .cse100 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse98 (select .cse104 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse99 (select .cse103 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse101 (store .cse103 .cse11 (+ .cse98 .cse99)))) (let ((.cse102 (select (select (store .cse100 |c_ULTIMATE.start_main_~b~0#1.base| .cse101) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse98 .cse99 (select (select (store .cse100 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse101 .cse7 (+ .cse98 .cse99 .cse102))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse102))))))) 13))) (= (select .cse105 .cse90) 13) (= (select .cse86 .cse90) 13) (= .cse78 4) (= (+ .cse26 1) .cse106) (= (+ .cse26 .cse107) .cse106) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= .cse107 1) (or .cse0 (forall ((v_ArrVal_680 Int)) (= 13 (let ((.cse114 (store .cse13 .cse15 v_ArrVal_680))) (let ((.cse110 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse114))) (let ((.cse113 (select .cse110 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse108 (select .cse113 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse109 (select .cse114 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse111 (store .cse113 .cse11 (+ .cse108 .cse109)))) (let ((.cse112 (select (select (store .cse110 |c_ULTIMATE.start_main_~b~0#1.base| .cse111) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse108 .cse109 (select (select (store .cse110 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse111 .cse7 (+ .cse108 .cse109 .cse112))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse112)))))))))) (= 13 (select .cse115 .cse90)) (or (and (or .cse17 (and (or .cse66 (forall ((v_ArrVal_680 Int)) (= (let ((.cse122 (store .cse47 .cse65 v_ArrVal_680))) (let ((.cse119 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse122))) (let ((.cse121 (select .cse119 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse116 (select .cse121 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse117 (select .cse122 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse120 (store .cse121 .cse11 (+ .cse116 .cse117)))) (let ((.cse118 (select (select (store .cse119 |c_ULTIMATE.start_main_~b~0#1.base| .cse120) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse116 .cse117 .cse118 (select (select (store .cse119 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse120 .cse7 (+ .cse116 .cse117 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13))) (or .cse39 (forall ((v_ArrVal_680 Int)) (= 13 (let ((.cse129 (store .cse47 .cse14 v_ArrVal_680))) (let ((.cse125 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse129))) (let ((.cse128 (select .cse125 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse123 (select .cse128 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse127 (select .cse129 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse126 (store .cse128 .cse11 (+ .cse123 .cse127)))) (let ((.cse124 (select (select (store .cse125 |c_ULTIMATE.start_main_~b~0#1.base| .cse126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse123 .cse124 (select (select (store .cse125 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse126 .cse7 (+ .cse123 .cse124 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse127)))))))))))) (or (forall ((v_ArrVal_680 Int)) (= (let ((.cse136 (store .cse37 .cse14 v_ArrVal_680))) (let ((.cse131 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse136))) (let ((.cse135 (select .cse131 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse130 (select .cse136 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse134 (select .cse135 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse132 (store .cse135 .cse11 (+ .cse130 .cse134)))) (let ((.cse133 (select (select (store .cse131 |c_ULTIMATE.start_main_~b~0#1.base| .cse132) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse130 (select (select (store .cse131 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse132 .cse7 (+ .cse130 .cse133 .cse134))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse133 .cse134))))))) 13)) .cse0)) .cse29) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 13 (select (store .cse115 .cse87 (+ .cse137 .cse138 .cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse115) |c_ULTIMATE.start_main_~a~0#1.base|) .cse65))) .cse90)) (= 2 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (or .cse17 (let ((.cse154 (+ 2 .cse89))) (and (or (let ((.cse146 (store .cse13 .cse65 .cse154))) (and (or .cse1 (forall ((v_ArrVal_680 Int)) (= (let ((.cse145 (store .cse146 .cse64 v_ArrVal_680))) (let ((.cse142 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse145))) (let ((.cse144 (select .cse142 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse140 (select .cse145 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse141 (select .cse144 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse143 (store .cse144 .cse11 (+ .cse140 .cse141)))) (let ((.cse139 (select (select (store .cse142 |c_ULTIMATE.start_main_~b~0#1.base| .cse143) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse139 .cse140 .cse141 (select (select (store .cse142 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse143 .cse7 (+ .cse139 .cse140 .cse141))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))) 13))) (or (forall ((v_ArrVal_680 Int)) (= 13 (let ((.cse153 (store .cse146 .cse16 v_ArrVal_680))) (let ((.cse150 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse153))) (let ((.cse152 (select .cse150 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse148 (select .cse152 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse149 (select .cse153 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse151 (store .cse152 .cse11 (+ .cse148 .cse149)))) (let ((.cse147 (select (select (store .cse150 |c_ULTIMATE.start_main_~b~0#1.base| .cse151) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ .cse147 .cse148 .cse149 (select (select (store .cse150 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse151 .cse7 (+ .cse147 .cse148 .cse149))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)))))))))) .cse56))) .cse66) (or .cse39 (forall ((v_ArrVal_680 Int)) (= (let ((.cse161 (store (store .cse13 .cse14 .cse154) .cse16 v_ArrVal_680))) (let ((.cse155 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse161))) (let ((.cse160 (select .cse155 |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse157 (select .cse161 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse158 (select .cse160 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse156 (store .cse160 .cse11 (+ .cse157 .cse158)))) (let ((.cse159 (select (select (store .cse155 |c_ULTIMATE.start_main_~b~0#1.base| .cse156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (+ (select (select (store .cse155 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse156 .cse7 (+ .cse157 .cse158 .cse159))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) .cse157 .cse158 .cse159))))))) 13)))))) (= (+ 2 .cse106) (+ .cse26 (select .cse162 .cse11)))))))))) is different from true [2022-11-25 17:15:32,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:36,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:41,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 17:15:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:15:45,291 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-11-25 17:15:45,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 17:15:45,291 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 38 states have internal predecessors, (67), 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 36 [2022-11-25 17:15:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:15:45,292 INFO L225 Difference]: With dead ends: 101 [2022-11-25 17:15:45,292 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 17:15:45,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 211.9s TimeCoverageRelationStatistics Valid=304, Invalid=1837, Unknown=29, NotChecked=182, Total=2352 [2022-11-25 17:15:45,293 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 30 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 76.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:15:45,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 166 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 536 Invalid, 24 Unknown, 3 Unchecked, 76.4s Time] [2022-11-25 17:15:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 17:15:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2022-11-25 17:15:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 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-25 17:15:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-11-25 17:15:45,321 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 36 [2022-11-25 17:15:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:15:45,321 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-11-25 17:15:45,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 38 states have internal predecessors, (67), 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-25 17:15:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-11-25 17:15:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:15:45,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:15:45,322 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:15:45,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 17:15:45,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:15:45,529 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:15:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:15:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1226631488, now seen corresponding path program 9 times [2022-11-25 17:15:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:15:45,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427286449] [2022-11-25 17:15:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:15:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:15:45,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:15:45,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672327852] [2022-11-25 17:15:45,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:15:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:15:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:15:45,560 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:15:45,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 17:15:48,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 17:15:48,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:15:48,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 87 conjunts are in the unsatisfiable core [2022-11-25 17:15:48,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:15:48,770 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-11-25 17:15:48,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-11-25 17:15:48,810 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-11-25 17:15:48,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-11-25 17:15:48,821 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-25 17:15:48,857 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-25 17:15:48,887 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-25 17:15:48,906 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2022-11-25 17:15:48,913 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 5 treesize of output 3 [2022-11-25 17:15:48,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-25 17:15:49,022 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:15:49,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-11-25 17:15:49,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:49,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:49,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-11-25 17:15:49,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:49,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:49,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 24 [2022-11-25 17:15:49,147 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:15:49,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2022-11-25 17:15:49,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:49,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:49,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-11-25 17:15:49,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:49,258 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:15:49,258 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 17:15:49,358 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 17:15:49,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 64 [2022-11-25 17:15:49,369 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-25 17:15:49,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 95 [2022-11-25 17:15:49,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 12 [2022-11-25 17:15:49,634 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2022-11-25 17:15:49,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:49,656 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-25 17:15:49,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 120 [2022-11-25 17:15:49,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 12 [2022-11-25 17:15:50,617 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 177 [2022-11-25 17:15:50,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:15:50,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:50,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:50,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:50,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:50,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 194 [2022-11-25 17:15:50,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:50,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:50,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 42 [2022-11-25 17:15:51,343 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-25 17:15:51,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 155 treesize of output 158 [2022-11-25 17:15:51,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 123 [2022-11-25 17:15:51,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 42 [2022-11-25 17:15:51,851 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:15:51,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 99 [2022-11-25 17:15:51,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 123 [2022-11-25 17:15:51,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:51,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 36 [2022-11-25 17:15:52,180 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:15:52,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 99 [2022-11-25 17:15:52,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 123 [2022-11-25 17:15:52,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 42 [2022-11-25 17:15:52,533 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 17:15:52,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 99 [2022-11-25 17:15:52,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 123 [2022-11-25 17:15:52,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:52,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 32 [2022-11-25 17:15:53,724 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:15:53,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 72 [2022-11-25 17:15:53,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:15:53,732 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 15 treesize of output 11 [2022-11-25 17:15:53,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-11-25 17:15:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:15:53,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:16:06,282 WARN L859 $PredicateComparison]: unable to prove that (or (< 6 c_~N~0) (let ((.cse19 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse7 (<= .cse19 2147483647)) (.cse18 (* .cse19 8))) (let ((.cse9 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse6 (not .cse7)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (* .cse17 8)) (.cse0 (<= .cse17 2147483647))) (and (or .cse0 (let ((.cse5 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse1 c_~N~0)) (= 3 (let ((.cse2 (store (store (store (store .cse3 .cse4 v_ArrVal_759) .cse5 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse1 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0)))) .cse6) (or .cse7 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse10 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (= (let ((.cse8 (store (store (store (store .cse3 .cse9 v_ArrVal_759) .cse5 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse10 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3) (not (< .cse10 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0)))))))) (or (let ((.cse14 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse12 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse12 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse13 (store (store (store (store .cse3 .cse9 v_ArrVal_759) .cse14 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse12 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3)))) .cse7) (or .cse6 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse15 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse15 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse16 (store (store (store (store .cse3 .cse4 v_ArrVal_759) .cse14 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse15 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))) (not .cse0)))))) (<= c_~N~0 5)) is different from true [2022-11-25 17:16:41,540 WARN L233 SmtUtils]: Spent 10.75s on a formula simplification. DAG size of input: 105 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:16:44,585 WARN L859 $PredicateComparison]: unable to prove that (or (< 6 c_~N~0) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse26 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse16 (<= .cse26 2147483647)) (.cse24 (* 8 .cse26)) (.cse25 (* .cse15 8)) (.cse23 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse0 (<= .cse23 2147483647)) (.cse11 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse12 (+ .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (not .cse16)) (.cse17 (* .cse23 8))) (and (or (not .cse0) (let ((.cse5 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse1 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse2 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse3 (store (store (store (store (store .cse4 .cse5 v_ArrVal_756) .cse6 v_ArrVal_759) .cse7 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse2 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (or (let ((.cse8 (<= .cse15 2147483647))) (and (or .cse8 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse9 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse10 (store (store (store (store (store .cse4 .cse5 v_ArrVal_756) .cse11 v_ArrVal_759) .cse12 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse9 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3))))) (or (not .cse8) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse13 c_~N~0)) (= (let ((.cse14 (store (store (store (store (store .cse4 .cse5 v_ArrVal_756) .cse6 v_ArrVal_759) .cse12 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse13 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0))))))) .cse16)))) (or .cse0 (let ((.cse20 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or .cse16 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse18 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse18 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse19 (store (store (store (store (store .cse4 .cse20 v_ArrVal_756) .cse11 v_ArrVal_759) .cse12 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse18 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse19) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3))))) (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse21 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse21 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse22 (store (store (store (store (store .cse4 .cse20 v_ArrVal_756) .cse6 v_ArrVal_759) .cse7 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse21 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse1)))))))) (<= c_~N~0 5)) is different from true [2022-11-25 17:16:44,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:16:44,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:16:44,623 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 17:16:44,624 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 3 case distinctions, treesize of input 116 treesize of output 1 [2022-11-25 17:16:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 1 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-25 17:16:44,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:16:44,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427286449] [2022-11-25 17:16:44,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:16:44,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672327852] [2022-11-25 17:16:44,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672327852] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:16:44,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:16:44,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2022-11-25 17:16:44,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728977910] [2022-11-25 17:16:44,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:16:44,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-25 17:16:44,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:16:44,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-25 17:16:44,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=2303, Unknown=7, NotChecked=206, Total=2970 [2022-11-25 17:16:44,633 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 55 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 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-25 17:16:46,853 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse44 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse46 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse47 (mod .cse46 4294967296)) (.cse38 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse26 (mod .cse44 4294967296))) (let ((.cse22 (* 8 .cse26)) (.cse34 (* .cse38 8)) (.cse5 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse10 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse18 (<= .cse47 2147483647)) (.cse45 (* .cse47 8))) (let ((.cse3 (< .cse46 c_~N~0)) (.cse11 (< 6 c_~N~0)) (.cse21 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse17 (not .cse18)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (<= c_~N~0 5)) (.cse28 (<= c_~N~0 .cse10)) (.cse29 (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse6 (<= c_~N~0 1)) (.cse9 (+ (* (mod .cse5 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse31 (+ (* (mod .cse10 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (+ .cse34 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse7 (+ .cse45 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (+ .cse22 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse4 (not (< 1 c_~N~0))) (.cse39 (< .cse44 c_~N~0))) (and (or (forall ((v_ArrVal_775 Int)) (= 3 (select (store .cse0 .cse1 v_ArrVal_775) .cse2))) .cse3 .cse4 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (or (<= c_~N~0 .cse5) .cse6 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int)) (= 3 (select (store (store (store (store .cse0 .cse1 v_ArrVal_768) .cse7 v_ArrVal_771) .cse8 v_ArrVal_773) .cse9 v_ArrVal_775) .cse2))) (< .cse10 c_~N~0)) (or .cse11 (let ((.cse23 (<= .cse26 2147483647))) (and (or (let ((.cse16 (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse12 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse12 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse13 (store (store (store (store .cse14 .cse15 v_ArrVal_759) .cse16 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse12 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse17) (or .cse18 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse19 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse19 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse20 (store (store (store (store .cse14 .cse21 v_ArrVal_759) .cse16 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse19 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3))))))) .cse23) (or (not .cse23) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse24 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse24 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse25 (store (store (store (store .cse14 .cse15 v_ArrVal_759) (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse24 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))) .cse27) (or .cse28 .cse29 .cse6 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int)) (= (select (store (store (store (store (store .cse0 .cse1 (let ((.cse30 (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) (+ (select .cse0 (+ .cse30 |c_ULTIMATE.start_main_~b~0#1.offset|)) (select .cse14 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse30))))) .cse7 v_ArrVal_768) .cse8 v_ArrVal_771) .cse9 v_ArrVal_773) .cse31 v_ArrVal_775) .cse2) 3))) (<= (mod c_~N~0 4294967296) 536870911) (or .cse11 .cse27 (let ((.cse35 (<= .cse38 2147483647))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse32 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse32 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse33 (store (store (store .cse14 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse32 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse35) (or (not .cse35) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse36 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse36 c_~N~0)) (= 3 (let ((.cse37 (store (store (store .cse14 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse36 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0)))))))) (or .cse39 .cse4 (not .cse3) (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int)) (= 3 (select (store (store .cse0 .cse1 v_ArrVal_773) .cse7 v_ArrVal_775) .cse2)))) (<= c_~N~0 2147483647) (or .cse11 (and (or .cse18 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse40 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse40 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse41 (store (store (store .cse14 .cse21 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse40 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse41) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or .cse17 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse42 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse42 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse43 (store (store (store .cse14 .cse15 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse42 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))))) .cse27) (or .cse4 (= 3 (select .cse0 .cse2))) (or .cse28 .cse29 .cse6 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int)) (= 3 (select (store (store (store (store .cse0 .cse7 v_ArrVal_768) .cse8 v_ArrVal_771) .cse9 v_ArrVal_773) .cse31 v_ArrVal_775) .cse2)))) (or (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int)) (= (select (store (store (store .cse0 .cse1 v_ArrVal_771) .cse7 v_ArrVal_773) .cse8 v_ArrVal_775) .cse2) 3)) .cse4 (not .cse39) (< .cse5 c_~N~0))))))) is different from true [2022-11-25 17:16:49,145 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod c_~N~0 4294967296) 536870911)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and .cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0) (and (not .cse0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0))) (<= c_~N~0 2147483647) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (< 6 c_~N~0) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296)) (.cse27 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse17 (<= .cse27 2147483647)) (.cse25 (* 8 .cse27)) (.cse26 (* .cse16 8)) (.cse24 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse1 (<= .cse24 2147483647)) (.cse12 (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse13 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse7 (+ .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (not .cse17)) (.cse18 (* .cse24 8))) (and (or (not .cse1) (let ((.cse6 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse2 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse3 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse3 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse4 (store (store (store (store (store .cse5 .cse6 v_ArrVal_756) .cse7 v_ArrVal_759) .cse8 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse3 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (or (let ((.cse9 (<= .cse16 2147483647))) (and (or .cse9 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse10 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse10 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse11 (store (store (store (store (store .cse5 .cse6 v_ArrVal_756) .cse12 v_ArrVal_759) .cse13 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse10 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3))))) (or (not .cse9) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse14 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse14 c_~N~0)) (= (let ((.cse15 (store (store (store (store (store .cse5 .cse6 v_ArrVal_756) .cse7 v_ArrVal_759) .cse13 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse14 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0))))))) .cse17)))) (or .cse1 (let ((.cse21 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or .cse17 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse19 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse19 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse20 (store (store (store (store (store .cse5 .cse21 v_ArrVal_756) .cse12 v_ArrVal_759) .cse13 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse19 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3))))) (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_756 Int) (v_ArrVal_765 Int)) (let ((.cse22 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse22 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse23 (store (store (store (store (store .cse5 .cse21 v_ArrVal_756) .cse7 v_ArrVal_759) .cse8 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse22 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) .cse2)))))))) (<= c_~N~0 5)) (= 2 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from true [2022-11-25 17:17:00,874 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse41 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse42 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse7 (<= .cse42 2147483647)) (.cse39 (* .cse42 8)) (.cse21 (<= .cse41 2147483647)) (.cse40 (* .cse41 8))) (let ((.cse23 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse20 (not .cse21)) (.cse19 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (< 6 c_~N~0)) (.cse10 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse6 (not .cse7)) (.cse4 (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (<= c_~N~0 5)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or .cse0 (let ((.cse15 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse12 (<= .cse15 2147483647)) (.cse11 (* 8 .cse15))) (and (or (let ((.cse5 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse1 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse2 (store (store (store (store .cse3 .cse4 v_ArrVal_759) .cse5 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse1 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse6) (or .cse7 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse8 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse8 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse9 (store (store (store (store .cse3 .cse10 v_ArrVal_759) .cse5 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse8 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3))))))) .cse12) (or (not .cse12) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse13 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse14 (store (store (store (store .cse3 .cse4 v_ArrVal_759) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse13 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))))) .cse16) (<= (mod c_~N~0 4294967296) 536870911) (or .cse0 (and (or .cse7 (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse17 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse17 c_~N~0)) (= 3 (let ((.cse18 (store (store (store (store .cse3 .cse19 v_ArrVal_759) .cse10 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse17 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0)))) .cse20) (or .cse21 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse24 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (= (let ((.cse22 (store (store (store (store .cse3 .cse23 v_ArrVal_759) .cse10 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse24 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3) (not (< .cse24 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0))))))) (or (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse25 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse25 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse26 (store (store (store (store .cse3 .cse23 v_ArrVal_759) .cse4 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse25 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) 3)))) .cse21) (or .cse20 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse27 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse27 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse28 (store (store (store (store .cse3 .cse19 v_ArrVal_759) .cse4 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse27 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) .cse6)) .cse16) (or .cse0 .cse16 (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse29 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse29 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse30 (store (store (store .cse3 .cse23 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse29 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse21) (or .cse20 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse31 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse31 c_~N~0)) (= 3 (let ((.cse32 (store (store (store .cse3 .cse19 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse31 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0))))))) (or (exists ((v_DerPreprocessor_20 Int)) (= 2 (select (let ((.cse34 (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) (let ((.cse33 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse34))) (store (store .cse3 .cse33 v_DerPreprocessor_20) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) .cse34) (select .cse3 .cse33)))) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (* (mod (+ 4294967294 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 8) 0)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= c_~N~0 2147483647) (or .cse0 (and (or .cse7 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse35 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse35 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse36 (store (store (store .cse3 .cse10 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse35 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or .cse6 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse37 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse37 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse38 (store (store (store .cse3 .cse4 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse37 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))))) .cse16) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~0#1| (+ c_~N~0 1)) (= 2 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from true [2022-11-25 17:17:08,646 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse56 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse59 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse31 (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (.cse58 (mod .cse59 4294967296)) (.cse57 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse27 (mod .cse56 4294967296))) (let ((.cse23 (* 8 .cse27)) (.cse36 (* .cse57 8)) (.cse6 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse11 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse3 (< .cse59 c_~N~0)) (.cse19 (<= .cse58 2147483647)) (.cse55 (* .cse58 8)) (.cse37 (<= .cse57 2147483647)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse41 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse31))) (let ((.cse42 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) .cse31)) (.cse32 (select .cse15 .cse41)) (.cse5 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse38 (not .cse37)) (.cse12 (< 6 c_~N~0)) (.cse22 (+ .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse16 (+ .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (<= c_~N~0 5)) (.cse43 (+ c_~N~0 1)) (.cse18 (not .cse19)) (.cse49 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse47 (not .cse3)) (.cse29 (<= c_~N~0 .cse11)) (.cse30 (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse7 (<= c_~N~0 1)) (.cse10 (+ (* (mod .cse6 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse33 (+ (* (mod .cse11 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (+ .cse36 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (+ .cse55 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (+ .cse23 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse4 (not (< 1 c_~N~0))) (.cse46 (< .cse56 c_~N~0))) (and (or (forall ((v_ArrVal_775 Int)) (= 3 (select (store .cse0 .cse1 v_ArrVal_775) .cse2))) .cse3 .cse4 .cse5) (or (<= c_~N~0 .cse6) .cse7 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int)) (= 3 (select (store (store (store (store .cse0 .cse1 v_ArrVal_768) .cse8 v_ArrVal_771) .cse9 v_ArrVal_773) .cse10 v_ArrVal_775) .cse2))) (< .cse11 c_~N~0)) (or .cse12 (let ((.cse24 (<= .cse27 2147483647))) (and (or (let ((.cse17 (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse13 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse14 (store (store (store (store .cse15 .cse16 v_ArrVal_759) .cse17 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse13 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse18) (or .cse19 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse20 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse20 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse21 (store (store (store (store .cse15 .cse22 v_ArrVal_759) .cse17 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse20 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3))))))) .cse24) (or (not .cse24) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse25 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse25 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse26 (store (store (store (store .cse15 .cse16 v_ArrVal_759) (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse25 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))) .cse28) (or .cse29 .cse30 .cse7 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int)) (= (select (store (store (store (store (store .cse0 .cse1 (+ (select .cse0 (+ .cse31 |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse32)) .cse8 v_ArrVal_768) .cse9 v_ArrVal_771) .cse10 v_ArrVal_773) .cse33 v_ArrVal_775) .cse2) 3))) (<= (mod c_~N~0 4294967296) 536870911) (or .cse12 .cse28 (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse34 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse34 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse35 (store (store (store .cse15 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse34 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse37) (or .cse38 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse39 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse39 c_~N~0)) (= 3 (let ((.cse40 (store (store (store .cse15 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse39 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0))))))) (or (exists ((v_DerPreprocessor_20 Int)) (= 2 (select (store (store .cse15 .cse41 v_DerPreprocessor_20) .cse42 .cse32) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (* (mod (+ 4294967294 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 8) 0)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (exists ((v_DerPreprocessor_18 Int)) (= 2 (select (store (store .cse15 .cse41 v_DerPreprocessor_18) .cse42 .cse32) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (or (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (< |ULTIMATE.start_main_~i~0#1| .cse43) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (exists ((v_DerPreprocessor_20 Int)) (= (select (let ((.cse45 (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (let ((.cse44 (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse15 .cse44 v_DerPreprocessor_20) (+ .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (select .cse15 .cse44)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (<= (+ 2 (* 4294967296 (div (+ c_~N~0 4294967293) 4294967296))) c_~N~0)) (or .cse46 .cse4 .cse47 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int)) (= 3 (select (store (store .cse0 .cse1 v_ArrVal_773) .cse8 v_ArrVal_775) .cse2)))) (or .cse5 (let ((.cse48 (+ .cse49 |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or .cse38 (= (select .cse0 .cse1) .cse48)) (or (= (select .cse0 (+ .cse36 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse48) .cse37)))) (<= c_~N~0 2147483647) (or .cse12 (and (or .cse19 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse50 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse50 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse51 (store (store (store .cse15 .cse22 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse50 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse51) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or .cse18 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse52 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse52 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse53 (store (store (store .cse15 .cse16 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse52 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse53) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))))) .cse28) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~0#1| .cse43) (or (let ((.cse54 (+ (* 3 |c_ULTIMATE.start_main_~i~0#1|) 3 .cse49))) (and (or (= (select .cse0 .cse8) .cse54) .cse18) (or .cse19 (= (select .cse0 (+ .cse55 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse54)))) .cse47) (or .cse29 .cse30 .cse7 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int)) (= 3 (select (store (store (store (store .cse0 .cse8 v_ArrVal_768) .cse9 v_ArrVal_771) .cse10 v_ArrVal_773) .cse33 v_ArrVal_775) .cse2)))) (or (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int)) (= (select (store (store (store .cse0 .cse1 v_ArrVal_771) .cse8 v_ArrVal_773) .cse9 v_ArrVal_775) .cse2) 3)) .cse4 (not .cse46) (< .cse6 c_~N~0))))))) is different from true [2022-11-25 17:17:11,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:17,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 17:17:21,616 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse55 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse58 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse31 (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (.cse57 (mod .cse58 4294967296)) (.cse56 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse27 (mod .cse55 4294967296))) (let ((.cse23 (* 8 .cse27)) (.cse36 (* .cse56 8)) (.cse6 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse11 (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse3 (< .cse58 c_~N~0)) (.cse19 (<= .cse57 2147483647)) (.cse54 (* .cse57 8)) (.cse37 (<= .cse56 2147483647)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse41 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse31))) (let ((.cse32 (select .cse15 .cse41)) (.cse5 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0))) (.cse38 (not .cse37)) (.cse12 (< 6 c_~N~0)) (.cse22 (+ .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse16 (+ .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse28 (<= c_~N~0 5)) (.cse42 (+ c_~N~0 1)) (.cse18 (not .cse19)) (.cse48 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse46 (not .cse3)) (.cse29 (<= c_~N~0 .cse11)) (.cse30 (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse7 (<= c_~N~0 1)) (.cse10 (+ (* (mod .cse6 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse33 (+ (* (mod .cse11 4294967296) 8) |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (+ .cse36 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (+ .cse54 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse9 (+ .cse23 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse4 (not (< 1 c_~N~0))) (.cse45 (< .cse55 c_~N~0))) (and (or (forall ((v_ArrVal_775 Int)) (= 3 (select (store .cse0 .cse1 v_ArrVal_775) .cse2))) .cse3 .cse4 .cse5) (or (<= c_~N~0 .cse6) .cse7 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int)) (= 3 (select (store (store (store (store .cse0 .cse1 v_ArrVal_768) .cse8 v_ArrVal_771) .cse9 v_ArrVal_773) .cse10 v_ArrVal_775) .cse2))) (< .cse11 c_~N~0)) (or .cse12 (let ((.cse24 (<= .cse27 2147483647))) (and (or (let ((.cse17 (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse13 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse14 (store (store (store (store .cse15 .cse16 v_ArrVal_759) .cse17 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse13 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse18) (or .cse19 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse20 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse20 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse21 (store (store (store (store .cse15 .cse22 v_ArrVal_759) .cse17 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse20 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3))))))) .cse24) (or (not .cse24) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse25 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse25 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse26 (store (store (store (store .cse15 .cse16 v_ArrVal_759) (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse25 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))) .cse28) (or .cse29 .cse30 .cse7 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int)) (= (select (store (store (store (store (store .cse0 .cse1 (+ (select .cse0 (+ .cse31 |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse32)) .cse8 v_ArrVal_768) .cse9 v_ArrVal_771) .cse10 v_ArrVal_773) .cse33 v_ArrVal_775) .cse2) 3))) (<= (mod c_~N~0 4294967296) 536870911) (or .cse12 .cse28 (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse34 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse34 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse35 (store (store (store .cse15 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse34 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse37) (or .cse38 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse39 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse39 c_~N~0)) (= 3 (let ((.cse40 (store (store (store .cse15 (+ .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse39 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0))))))) (or (exists ((v_DerPreprocessor_20 Int)) (= 2 (select (store (store .cse15 .cse41 v_DerPreprocessor_20) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) .cse31) .cse32) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (* (mod (+ 4294967294 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 8) 0)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (or (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (< |ULTIMATE.start_main_~i~0#1| .cse42) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (exists ((v_DerPreprocessor_20 Int)) (= (select (let ((.cse44 (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (let ((.cse43 (+ .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse15 .cse43 v_DerPreprocessor_20) (+ .cse44 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (select .cse15 .cse43)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) (<= (+ 2 (* 4294967296 (div (+ c_~N~0 4294967293) 4294967296))) c_~N~0)) (or .cse45 .cse4 .cse46 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int)) (= 3 (select (store (store .cse0 .cse1 v_ArrVal_773) .cse8 v_ArrVal_775) .cse2)))) (or .cse5 (let ((.cse47 (+ .cse48 |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or .cse38 (= (select .cse0 .cse1) .cse47)) (or (= (select .cse0 (+ .cse36 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse47) .cse37)))) (<= c_~N~0 2147483647) (or .cse12 (and (or .cse19 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse49 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse49 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse50 (store (store (store .cse15 .cse22 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse49 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse50) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or .cse18 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse51 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse51 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse52 (store (store (store .cse15 .cse16 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse51 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse52) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))))) .cse28) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~0#1| .cse42) (or (let ((.cse53 (+ (* 3 |c_ULTIMATE.start_main_~i~0#1|) 3 .cse48))) (and (or (= (select .cse0 .cse8) .cse53) .cse18) (or .cse19 (= (select .cse0 (+ .cse54 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse53)))) .cse46) (or .cse29 .cse30 .cse7 (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int)) (= 3 (select (store (store (store (store .cse0 .cse8 v_ArrVal_768) .cse9 v_ArrVal_771) .cse10 v_ArrVal_773) .cse33 v_ArrVal_775) .cse2)))) (or (forall ((v_ArrVal_775 Int) (v_ArrVal_773 Int) (v_ArrVal_771 Int)) (= (select (store (store (store .cse0 .cse1 v_ArrVal_771) .cse8 v_ArrVal_773) .cse9 v_ArrVal_775) .cse2) 3)) .cse4 (not .cse45) (< .cse6 c_~N~0))))))) is different from true [2022-11-25 17:17:24,034 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse7 (<= .cse39 2147483647)) (.cse38 (* .cse39 8))) (let ((.cse29 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse25 (<= (+ 2 (* 4294967296 (div (+ c_~N~0 4294967293) 4294967296))) c_~N~0)) (.cse0 (< 6 c_~N~0)) (.cse10 (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse6 (not .cse7)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (<= c_~N~0 5)) (.cse28 (+ c_~N~0 1))) (and (or .cse0 (let ((.cse15 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse12 (<= .cse15 2147483647)) (.cse11 (* 8 .cse15))) (and (or (let ((.cse5 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse1 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse2 (store (store (store (store .cse3 .cse4 v_ArrVal_759) .cse5 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse1 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse6) (or .cse7 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse8 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse8 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse9 (store (store (store (store .cse3 .cse10 v_ArrVal_759) .cse5 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse8 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3))))))) .cse12) (or (not .cse12) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse13 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse14 (store (store (store (store .cse3 .cse4 v_ArrVal_759) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse13 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))))) .cse16) (<= (mod c_~N~0 4294967296) 536870911) (or .cse0 .cse16 (let ((.cse23 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse20 (<= .cse23 2147483647)) (.cse19 (* .cse23 8))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse17 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse17 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse18 (store (store (store .cse3 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse17 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse20) (or (not .cse20) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse21 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse21 c_~N~0)) (= 3 (let ((.cse22 (store (store (store .cse3 (+ .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse21 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0))))))))) (let ((.cse24 (select .cse29 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (or (and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) .cse24))) .cse25) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse26 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (exists ((v_prenex_24 Int) (v_DerPreprocessor_20 Int)) (and (not (< v_prenex_24 c_~N~0)) (= (select (let ((.cse27 (* (mod (+ 4294967295 v_prenex_24) 4294967296) 8))) (store (store .cse26 .cse27 v_DerPreprocessor_20) (+ .cse27 (- 34359738368)) (select .cse26 .cse27))) 0) 2) (< v_prenex_24 .cse28))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (select .cse26 0) 1) .cse24)))))) (or (exists ((v_DerPreprocessor_20 Int)) (= 2 (select (let ((.cse31 (* 8 (mod (+ 4294967295 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)))) (let ((.cse30 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse31))) (store (store .cse3 .cse30 v_DerPreprocessor_20) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368) .cse31) (select .cse3 .cse30)))) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (* (mod (+ 4294967294 |c_ULTIMATE.start_main_~i~0#1|) 4294967296) 8) 0)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse29 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (or (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (< |ULTIMATE.start_main_~i~0#1| .cse28) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (exists ((v_DerPreprocessor_20 Int)) (= (select (let ((.cse33 (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (let ((.cse32 (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse3 .cse32 v_DerPreprocessor_20) (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) (select .cse3 .cse32)))) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)))) .cse25) (<= c_~N~0 2147483647) (or .cse0 (and (or .cse7 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse34 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse34 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse35 (store (store (store .cse3 .cse10 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse34 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or .cse6 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse36 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse36 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse37 (store (store (store .cse3 .cse4 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse36 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))))) .cse16) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (< |c_ULTIMATE.start_main_~i~0#1| .cse28))))) is different from true [2022-11-25 17:17:32,720 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse35 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse36 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse37 (mod .cse35 4294967296))) (let ((.cse7 (<= .cse37 2147483647)) (.cse33 (* .cse37 8)) (.cse23 (<= .cse36 2147483647))) (let ((.cse24 (not .cse23)) (.cse22 (* .cse36 8)) (.cse0 (< 6 c_~N~0)) (.cse10 (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ .cse33 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (<= c_~N~0 5)) (.cse6 (not .cse7)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse28 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (and (= 5 |c_ULTIMATE.start_main_~i~0#1|) (< 2 c_~N~0) (or .cse0 (let ((.cse15 (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (let ((.cse12 (<= .cse15 2147483647)) (.cse11 (* 8 .cse15))) (and (or (let ((.cse5 (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse1 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse2 (store (store (store (store .cse3 .cse4 v_ArrVal_759) .cse5 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse1 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse6) (or .cse7 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse8 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse8 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse9 (store (store (store (store .cse3 .cse10 v_ArrVal_759) .cse5 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse8 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3))))))) .cse12) (or (not .cse12) (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_759 Int) (v_ArrVal_765 Int)) (let ((.cse13 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse13 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse14 (store (store (store (store .cse3 .cse4 v_ArrVal_759) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse13 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))))) .cse16) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (v_prenex_24 Int) (v_DerPreprocessor_20 Int)) (let ((.cse17 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (not (< v_prenex_24 c_~N~0)) (= (+ (select .cse17 0) 1) (select .cse18 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (= (select (let ((.cse19 (* (mod (+ 4294967295 v_prenex_24) 4294967296) 8))) (store (store .cse17 .cse19 v_DerPreprocessor_20) (+ .cse19 (- 34359738368)) (select .cse17 .cse19))) 0) 2) (< v_prenex_24 (+ c_~N~0 1))))) (<= (mod c_~N~0 4294967296) 536870911) (or .cse0 .cse16 (and (or (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse20 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse20 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse21 (store (store (store .cse3 (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse20 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))) .cse23) (or .cse24 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse25 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse25 c_~N~0)) (= 3 (let ((.cse26 (store (store (store .cse3 (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse25 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0))))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse18 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (or (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (let ((.cse27 (+ .cse28 |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or .cse24 (= (select .cse18 (+ .cse22 |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse27)) (or (= (select .cse18 (+ .cse22 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse27) .cse23)))) (<= c_~N~0 2147483647) (or .cse0 (and (or .cse7 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse29 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse29 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= 3 (let ((.cse30 (store (store (store .cse3 .cse10 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse29 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (or .cse6 (forall ((v_ArrVal_763 Int) (v_ArrVal_761 Int) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (v_ArrVal_765 Int)) (let ((.cse31 (+ |v_ULTIMATE.start_main_~i~0#1_198| 1))) (or (not (< .cse31 c_~N~0)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_198|) c_~N~0) (= (let ((.cse32 (store (store (store .cse3 .cse4 v_ArrVal_761) (+ (* 8 (mod |v_ULTIMATE.start_main_~i~0#1_198| 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_763) (+ (* 8 (mod .cse31 4294967296)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_765))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)))))) .cse16) (or (let ((.cse34 (+ (* 3 |c_ULTIMATE.start_main_~i~0#1|) 3 .cse28))) (and (or (= (select .cse18 (+ .cse33 |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse34) .cse6) (or .cse7 (= (select .cse18 (+ .cse33 (- 34359738368) |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse34)))) (not (< .cse35 c_~N~0)))))))) is different from true [2022-11-25 17:17:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:17:56,034 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2022-11-25 17:17:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-11-25 17:17:56,034 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 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 36 [2022-11-25 17:17:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:17:56,036 INFO L225 Difference]: With dead ends: 193 [2022-11-25 17:17:56,036 INFO L226 Difference]: Without dead ends: 191 [2022-11-25 17:17:56,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 5729 ImplicationChecksByTransitivity, 109.7s TimeCoverageRelationStatistics Valid=3212, Invalid=16548, Unknown=16, NotChecked=2574, Total=22350 [2022-11-25 17:17:56,041 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 399 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 242 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:17:56,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 479 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1080 Invalid, 2 Unknown, 186 Unchecked, 11.8s Time] [2022-11-25 17:17:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-25 17:17:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 128. [2022-11-25 17:17:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 127 states have internal predecessors, (148), 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-25 17:17:56,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 148 transitions. [2022-11-25 17:17:56,120 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 148 transitions. Word has length 36 [2022-11-25 17:17:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:17:56,120 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 148 transitions. [2022-11-25 17:17:56,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 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-25 17:17:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 148 transitions. [2022-11-25 17:17:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:17:56,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:17:56,121 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:17:56,129 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-25 17:17:56,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 17:17:56,322 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:17:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:17:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash 934780102, now seen corresponding path program 5 times [2022-11-25 17:17:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:17:56,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696444224] [2022-11-25 17:17:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:17:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:17:56,367 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:17:56,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013151980] [2022-11-25 17:17:56,368 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:17:56,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:17:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:17:56,370 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:17:56,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed20ba64-7d05-424e-b2d9-a98033a22863/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process