./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:04:18,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:04:18,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:04:18,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:04:18,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:04:18,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:04:18,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:04:18,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:04:18,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:04:18,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:04:18,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:04:18,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:04:18,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:04:18,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:04:18,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:04:18,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:04:18,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:04:18,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:04:18,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:04:18,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:04:18,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:04:18,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:04:18,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:04:18,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:04:18,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:04:18,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:04:18,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:04:18,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:04:18,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:04:18,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:04:18,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:04:18,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:04:18,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:04:18,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:04:18,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:04:18,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:04:18,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:04:18,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:04:18,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:04:18,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:04:18,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:04:18,373 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:04:18,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:04:18,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:04:18,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:04:18,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:04:18,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:04:18,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:04:18,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:04:18,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:04:18,420 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:04:18,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:04:18,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:04:18,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:04:18,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:04:18,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:04:18,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:04:18,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:04:18,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:04:18,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:04:18,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:04:18,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:04:18,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:04:18,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:04:18,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:04:18,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:04:18,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:18,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:04:18,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:04:18,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:04:18,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:04:18,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:04:18,427 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:04:18,428 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:04:18,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:04:18,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2022-11-02 21:04:18,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:04:18,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:04:18,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:04:18,745 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:04:18,746 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:04:18,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-11-02 21:04:18,821 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/data/126bb940c/2d900161ed804d29a238d94fd0a5301d/FLAG7d2620ea9 [2022-11-02 21:04:19,441 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:04:19,447 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2022-11-02 21:04:19,465 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/data/126bb940c/2d900161ed804d29a238d94fd0a5301d/FLAG7d2620ea9 [2022-11-02 21:04:19,705 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/data/126bb940c/2d900161ed804d29a238d94fd0a5301d [2022-11-02 21:04:19,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:04:19,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:04:19,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:19,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:04:19,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:04:19,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:19" (1/1) ... [2022-11-02 21:04:19,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8d9507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:19, skipping insertion in model container [2022-11-02 21:04:19,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:04:19" (1/1) ... [2022-11-02 21:04:19,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:04:19,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:04:20,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-11-02 21:04:20,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:20,247 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:04:20,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2022-11-02 21:04:20,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:04:20,345 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:04:20,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20 WrapperNode [2022-11-02 21:04:20,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:04:20,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:20,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:04:20,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:04:20,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,392 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2022-11-02 21:04:20,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:04:20,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:04:20,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:04:20,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:04:20,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,422 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:04:20,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:04:20,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:04:20,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:04:20,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (1/1) ... [2022-11-02 21:04:20,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:04:20,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:20,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:04:20,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:04:20,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:04:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:04:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 21:04:20,513 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 21:04:20,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:04:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:04:20,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:04:20,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:04:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:04:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:04:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:04:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:04:20,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:04:20,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:04:20,695 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:04:20,697 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:04:20,992 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:04:20,998 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:04:20,998 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 21:04:21,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:21 BoogieIcfgContainer [2022-11-02 21:04:21,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:04:21,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:04:21,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:04:21,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:04:21,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:04:19" (1/3) ... [2022-11-02 21:04:21,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d81c090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:21, skipping insertion in model container [2022-11-02 21:04:21,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:04:20" (2/3) ... [2022-11-02 21:04:21,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d81c090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:04:21, skipping insertion in model container [2022-11-02 21:04:21,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:04:21" (3/3) ... [2022-11-02 21:04:21,010 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-11-02 21:04:21,034 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:04:21,034 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:04:21,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:04:21,117 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;@69239def, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:04:21,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:04:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:04:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:04:21,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:21,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:21,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash -346371136, now seen corresponding path program 1 times [2022-11-02 21:04:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:21,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77144375] [2022-11-02 21:04:21,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:21,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 21:04:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:21,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77144375] [2022-11-02 21:04:21,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77144375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:21,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:21,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:04:21,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664362272] [2022-11-02 21:04:21,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:21,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:04:21,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:21,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:04:21,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:21,454 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:04:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:21,535 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-11-02 21:04:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:04:21,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-02 21:04:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:21,545 INFO L225 Difference]: With dead ends: 65 [2022-11-02 21:04:21,545 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 21:04:21,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:04:21,551 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:21,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 21:04:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-02 21:04:21,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:04:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-11-02 21:04:21,602 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-11-02 21:04:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:21,603 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-11-02 21:04:21,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:04:21,604 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-11-02 21:04:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 21:04:21,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:21,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:21,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:04:21,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:21,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1530291827, now seen corresponding path program 1 times [2022-11-02 21:04:21,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:21,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680939111] [2022-11-02 21:04:21,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:21,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:21,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 21:04:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:21,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:21,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680939111] [2022-11-02 21:04:21,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680939111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:21,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:21,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:21,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225661896] [2022-11-02 21:04:21,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:21,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:21,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:21,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:21,844 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:04:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:21,933 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-11-02 21:04:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:21,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-02 21:04:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:21,935 INFO L225 Difference]: With dead ends: 58 [2022-11-02 21:04:21,935 INFO L226 Difference]: Without dead ends: 35 [2022-11-02 21:04:21,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:21,937 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:21,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-02 21:04:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-11-02 21:04:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:04:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-11-02 21:04:21,946 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2022-11-02 21:04:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:21,946 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-02 21:04:21,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 21:04:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-11-02 21:04:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 21:04:21,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:21,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:21,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:04:21,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:21,949 INFO L85 PathProgramCache]: Analyzing trace with hash 878865159, now seen corresponding path program 1 times [2022-11-02 21:04:21,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:21,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404085934] [2022-11-02 21:04:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:21,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:04:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:04:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:04:22,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:22,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404085934] [2022-11-02 21:04:22,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404085934] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:22,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:22,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:04:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345007982] [2022-11-02 21:04:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:22,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:04:22,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:22,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:04:22,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:22,185 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:04:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:22,276 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-11-02 21:04:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:04:22,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-11-02 21:04:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:22,278 INFO L225 Difference]: With dead ends: 63 [2022-11-02 21:04:22,278 INFO L226 Difference]: Without dead ends: 35 [2022-11-02 21:04:22,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:04:22,280 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:22,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-02 21:04:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-11-02 21:04:22,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:04:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-11-02 21:04:22,287 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2022-11-02 21:04:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:22,287 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-11-02 21:04:22,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 21:04:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-11-02 21:04:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 21:04:22,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:22,289 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:22,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:04:22,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:22,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:22,290 INFO L85 PathProgramCache]: Analyzing trace with hash -709482743, now seen corresponding path program 1 times [2022-11-02 21:04:22,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:22,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092530319] [2022-11-02 21:04:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:04:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:04:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:04:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:22,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092530319] [2022-11-02 21:04:22,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092530319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:22,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593738814] [2022-11-02 21:04:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:22,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:22,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:22,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:04:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:22,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:04:22,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:22,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:04:22,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593738814] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:04:22,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:04:22,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-02 21:04:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321849590] [2022-11-02 21:04:22,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:22,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:22,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:22,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:22,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:22,903 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 21:04:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:23,005 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-11-02 21:04:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:04:23,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2022-11-02 21:04:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:23,006 INFO L225 Difference]: With dead ends: 59 [2022-11-02 21:04:23,006 INFO L226 Difference]: Without dead ends: 36 [2022-11-02 21:04:23,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:23,008 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:23,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-02 21:04:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-02 21:04:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:04:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-11-02 21:04:23,016 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2022-11-02 21:04:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:23,016 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-11-02 21:04:23,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 21:04:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-11-02 21:04:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 21:04:23,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:23,018 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:23,055 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 21:04:23,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:23,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:23,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:23,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1607276515, now seen corresponding path program 1 times [2022-11-02 21:04:23,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:23,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887270527] [2022-11-02 21:04:23,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:04:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:04:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:23,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:04:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:04:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887270527] [2022-11-02 21:04:23,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887270527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143857476] [2022-11-02 21:04:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:23,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:23,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:23,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:23,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:04:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:24,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 21:04:24,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:24,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 21:04:24,686 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_520 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_520) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-02 21:04:24,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:24,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 24 [2022-11-02 21:04:24,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 21:04:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-11-02 21:04:24,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:24,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_523) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (<= 1 .cse0) (not (< |v_node_create_~temp~0#1.base_13| |c_#StackHeapBarrier|))))) is different from false [2022-11-02 21:04:24,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143857476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:24,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:04:24,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-11-02 21:04:24,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847825343] [2022-11-02 21:04:24,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:24,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-02 21:04:24,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:24,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-02 21:04:24,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=525, Unknown=2, NotChecked=94, Total=702 [2022-11-02 21:04:24,905 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 21:04:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:25,370 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-11-02 21:04:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:04:25,371 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-11-02 21:04:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:25,372 INFO L225 Difference]: With dead ends: 46 [2022-11-02 21:04:25,372 INFO L226 Difference]: Without dead ends: 36 [2022-11-02 21:04:25,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=856, Unknown=2, NotChecked=122, Total=1122 [2022-11-02 21:04:25,374 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:25,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 192 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 147 Invalid, 0 Unknown, 38 Unchecked, 0.2s Time] [2022-11-02 21:04:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-02 21:04:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-02 21:04:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:04:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-11-02 21:04:25,390 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 37 [2022-11-02 21:04:25,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:25,391 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-11-02 21:04:25,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 21:04:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-11-02 21:04:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 21:04:25,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:25,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:25,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:25,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:25,611 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:25,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:25,611 INFO L85 PathProgramCache]: Analyzing trace with hash -859241559, now seen corresponding path program 1 times [2022-11-02 21:04:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:25,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793031461] [2022-11-02 21:04:25,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:25,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:27,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:04:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:27,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:04:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:27,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:04:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:04:27,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:27,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793031461] [2022-11-02 21:04:27,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793031461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:27,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14968552] [2022-11-02 21:04:27,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:27,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:27,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:27,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:27,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:04:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:27,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-02 21:04:27,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:27,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:04:27,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 21:04:27,946 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:04:27,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 21:04:28,157 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:04:28,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:04:28,320 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-02 21:04:28,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-02 21:04:28,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:04:28,577 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:04:28,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-02 21:04:29,070 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 21:04:29,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 30 [2022-11-02 21:04:29,086 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:04:29,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-02 21:04:29,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:29,336 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 21:04:29,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 79 [2022-11-02 21:04:29,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:29,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 64 [2022-11-02 21:04:29,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:29,384 INFO L356 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2022-11-02 21:04:29,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 39 [2022-11-02 21:04:29,795 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-02 21:04:29,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 69 [2022-11-02 21:04:29,835 INFO L356 Elim1Store]: treesize reduction 114, result has 15.6 percent of original size [2022-11-02 21:04:29,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 66 [2022-11-02 21:04:29,877 INFO L356 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-02 21:04:29,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 120 [2022-11-02 21:04:29,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:29,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 71 [2022-11-02 21:04:29,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-02 21:04:29,987 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 21:04:29,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 23 [2022-11-02 21:04:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 21:04:30,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:32,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14968552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:32,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:04:32,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 45 [2022-11-02 21:04:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233192446] [2022-11-02 21:04:32,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:32,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-02 21:04:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:32,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-02 21:04:32,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2361, Unknown=7, NotChecked=0, Total=2550 [2022-11-02 21:04:32,931 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 45 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:04:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:35,021 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-11-02 21:04:35,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 21:04:35,023 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-11-02 21:04:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:35,025 INFO L225 Difference]: With dead ends: 67 [2022-11-02 21:04:35,025 INFO L226 Difference]: Without dead ends: 39 [2022-11-02 21:04:35,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=351, Invalid=3932, Unknown=7, NotChecked=0, Total=4290 [2022-11-02 21:04:35,028 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:35,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 396 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 637 Invalid, 0 Unknown, 9 Unchecked, 0.7s Time] [2022-11-02 21:04:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-02 21:04:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-11-02 21:04:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:04:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-11-02 21:04:35,039 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 40 [2022-11-02 21:04:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:35,040 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-11-02 21:04:35,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 37 states have internal predecessors, (64), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:04:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-11-02 21:04:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 21:04:35,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:35,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:35,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:35,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:35,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1146227584, now seen corresponding path program 1 times [2022-11-02 21:04:35,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:35,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358038418] [2022-11-02 21:04:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:38,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:04:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:04:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:04:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:04:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:39,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358038418] [2022-11-02 21:04:39,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358038418] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:39,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617008785] [2022-11-02 21:04:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:39,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:39,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:39,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:39,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:04:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:39,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-02 21:04:39,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:39,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:04:40,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 21:04:40,540 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:04:40,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:04:40,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:04:40,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:40,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-02 21:04:40,821 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 21:04:40,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-11-02 21:04:40,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 21:04:41,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:41,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2022-11-02 21:04:41,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 21:04:41,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:04:41,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-02 21:04:41,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:41,861 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 21:04:41,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 72 [2022-11-02 21:04:41,890 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 21:04:41,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-02 21:04:41,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 21:04:41,936 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 21:04:41,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 21:04:41,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:41,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:04:43,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:43,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:43,231 INFO L356 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-11-02 21:04:43,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 212 treesize of output 106 [2022-11-02 21:04:43,285 INFO L356 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-02 21:04:43,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 294 treesize of output 185 [2022-11-02 21:04:43,317 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-02 21:04:43,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 198 [2022-11-02 21:04:43,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2022-11-02 21:04:43,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:43,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:43,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2022-11-02 21:04:43,564 INFO L356 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-02 21:04:43,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 57 [2022-11-02 21:04:43,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:43,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-11-02 21:04:43,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-02 21:04:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:43,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:43,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1038) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1031) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 21:04:44,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse2)) (.cse1 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_10| 4))) (or (not (= (select .cse0 .cse1) 0)) (= (select (select (store (store |c_#memory_int| .cse2 v_ArrVal_1036) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1038) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse0 .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1031) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store (select |c_#memory_$Pointer$.offset| .cse2) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|))))) is different from false [2022-11-02 21:04:44,143 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_10| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1036) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1038) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1031) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-11-02 21:04:44,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_10| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1036) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1038) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1031) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-11-02 21:04:44,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_10| Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (v_ArrVal_1051 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1052)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1051))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_10| 4))) (or (= (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1053) .cse0 v_ArrVal_1036) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1038) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1031) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| v_ArrVal_1033) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16|) 0)) (not (< |v_ULTIMATE.start_dll_append_#t~ret7#1.base_16| |c_#StackHeapBarrier|)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2022-11-02 21:04:44,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617008785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:44,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:04:44,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 56 [2022-11-02 21:04:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868728461] [2022-11-02 21:04:44,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:44,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-02 21:04:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:44,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-02 21:04:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3121, Unknown=7, NotChecked=580, Total=3906 [2022-11-02 21:04:44,306 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 56 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 47 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:04:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:48,236 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-11-02 21:04:48,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 21:04:48,239 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 47 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2022-11-02 21:04:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:48,240 INFO L225 Difference]: With dead ends: 54 [2022-11-02 21:04:48,240 INFO L226 Difference]: Without dead ends: 52 [2022-11-02 21:04:48,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=411, Invalid=5454, Unknown=7, NotChecked=770, Total=6642 [2022-11-02 21:04:48,244 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:48,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 437 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 959 Invalid, 0 Unknown, 32 Unchecked, 1.0s Time] [2022-11-02 21:04:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-02 21:04:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-11-02 21:04:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:04:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-11-02 21:04:48,257 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 44 [2022-11-02 21:04:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:48,258 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-11-02 21:04:48,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 47 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:04:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-11-02 21:04:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 21:04:48,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:48,260 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:48,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 21:04:48,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:48,487 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:48,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1173262244, now seen corresponding path program 1 times [2022-11-02 21:04:48,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:48,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978171167] [2022-11-02 21:04:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:48,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:04:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:04:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:48,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:04:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 21:04:48,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:48,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978171167] [2022-11-02 21:04:48,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978171167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:04:48,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:04:48,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:04:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793583112] [2022-11-02 21:04:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:04:48,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:04:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:48,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:04:48,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:04:48,707 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:04:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:48,802 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-11-02 21:04:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:04:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-02 21:04:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:48,807 INFO L225 Difference]: With dead ends: 56 [2022-11-02 21:04:48,808 INFO L226 Difference]: Without dead ends: 51 [2022-11-02 21:04:48,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:04:48,809 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:48,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:04:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-02 21:04:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-11-02 21:04:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 21:04:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-11-02 21:04:48,828 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 45 [2022-11-02 21:04:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:48,830 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-11-02 21:04:48,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:04:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-11-02 21:04:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 21:04:48,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:48,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:48,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:04:48,839 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:48,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:48,839 INFO L85 PathProgramCache]: Analyzing trace with hash -731397669, now seen corresponding path program 2 times [2022-11-02 21:04:48,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:48,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837968443] [2022-11-02 21:04:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:48,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:51,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:04:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:04:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:51,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:04:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:04:51,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:04:51,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837968443] [2022-11-02 21:04:51,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837968443] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:51,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751431714] [2022-11-02 21:04:51,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:04:51,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:51,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:51,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:51,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:04:52,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:04:52,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:04:52,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 193 conjunts are in the unsatisfiable core [2022-11-02 21:04:52,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:52,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:04:52,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:04:52,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:04:53,025 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:04:53,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:04:53,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:04:53,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:04:53,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-02 21:04:53,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:04:53,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2022-11-02 21:04:53,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:04:53,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:53,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-02 21:04:53,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:53,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:53,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 21:04:53,406 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 21:04:53,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 75 [2022-11-02 21:04:53,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:53,426 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-02 21:04:53,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-11-02 21:04:53,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:53,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 21:04:53,982 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 21:04:53,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 49 [2022-11-02 21:04:54,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 21:04:54,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 21:04:54,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:54,379 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 21:04:54,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 83 [2022-11-02 21:04:54,402 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-02 21:04:54,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-02 21:04:54,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 21:04:54,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:54,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:54,472 INFO L356 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-02 21:04:54,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 68 [2022-11-02 21:04:54,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:04:54,514 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 21:04:54,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 21:04:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:04:55,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:04:55,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1463 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1463) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1464) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1465) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 21:04:57,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751431714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:04:57,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:04:57,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2022-11-02 21:04:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487181558] [2022-11-02 21:04:57,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:04:57,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 21:04:57,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:04:57,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 21:04:57,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3004, Unknown=3, NotChecked=110, Total=3306 [2022-11-02 21:04:57,391 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 46 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 38 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:04:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:59,686 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-11-02 21:04:59,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 21:04:59,687 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 38 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-02 21:04:59,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:59,688 INFO L225 Difference]: With dead ends: 79 [2022-11-02 21:04:59,688 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 21:04:59,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=325, Invalid=4646, Unknown=3, NotChecked=138, Total=5112 [2022-11-02 21:04:59,690 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:59,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 397 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 672 Invalid, 0 Unknown, 80 Unchecked, 0.9s Time] [2022-11-02 21:04:59,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 21:04:59,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-11-02 21:04:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 21:04:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-11-02 21:04:59,709 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 46 [2022-11-02 21:04:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:59,709 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-11-02 21:04:59,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 38 states have internal predecessors, (69), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 21:04:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-11-02 21:04:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 21:04:59,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:59,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:59,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-02 21:04:59,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:59,931 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:59,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2018358036, now seen corresponding path program 1 times [2022-11-02 21:04:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:59,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735481904] [2022-11-02 21:04:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:59,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 21:05:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 21:05:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:05:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:05:04,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:04,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735481904] [2022-11-02 21:05:04,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735481904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:05:04,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205852534] [2022-11-02 21:05:04,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:04,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:05:04,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:04,390 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:05:04,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0f41c2c-7ac2-4ccc-9323-21861c7ba944/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:05:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:04,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 161 conjunts are in the unsatisfiable core [2022-11-02 21:05:04,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:05:04,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 21:05:05,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:05,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 21:05:05,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:05,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-02 21:05:05,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-02 21:05:05,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-02 21:05:05,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-02 21:05:05,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-02 21:05:05,749 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 21:05:05,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 21:05:05,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:05:05,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:05:05,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:05:05,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:05:05,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-02 21:05:05,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:05:05,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-11-02 21:05:05,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 21:05:06,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:06,186 INFO L356 Elim1Store]: treesize reduction 55, result has 14.1 percent of original size [2022-11-02 21:05:06,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 106 [2022-11-02 21:05:06,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:06,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-11-02 21:05:06,220 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-02 21:05:06,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-11-02 21:05:07,039 INFO L356 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2022-11-02 21:05:07,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 65 [2022-11-02 21:05:07,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:07,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:07,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2022-11-02 21:05:07,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 21:05:07,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 21:05:07,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:07,358 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 21:05:07,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 191 treesize of output 159 [2022-11-02 21:05:07,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:07,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:07,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:07,391 INFO L356 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2022-11-02 21:05:07,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 162 [2022-11-02 21:05:07,425 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-02 21:05:07,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-11-02 21:05:07,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 21:05:08,520 INFO L356 Elim1Store]: treesize reduction 47, result has 48.9 percent of original size [2022-11-02 21:05:08,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 64 [2022-11-02 21:05:08,609 INFO L356 Elim1Store]: treesize reduction 170, result has 17.5 percent of original size [2022-11-02 21:05:08,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 130 [2022-11-02 21:05:08,671 INFO L356 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2022-11-02 21:05:08,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 298 treesize of output 254 [2022-11-02 21:05:08,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:08,746 INFO L356 Elim1Store]: treesize reduction 112, result has 23.3 percent of original size [2022-11-02 21:05:08,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 214 [2022-11-02 21:05:08,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:08,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 21:05:08,799 INFO L356 Elim1Store]: treesize reduction 43, result has 10.4 percent of original size [2022-11-02 21:05:08,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 231 [2022-11-02 21:05:08,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2022-11-02 21:05:08,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-11-02 21:05:18,407 INFO L356 Elim1Store]: treesize reduction 116, result has 84.8 percent of original size [2022-11-02 21:05:18,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 17 new quantified variables, introduced 55 case distinctions, treesize of input 691 treesize of output 887 [2022-11-02 21:05:20,767 INFO L356 Elim1Store]: treesize reduction 36, result has 91.8 percent of original size [2022-11-02 21:05:20,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 647 treesize of output 884