./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN --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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- 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-6b4ec56 [2022-11-20 10:52:55,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:52:56,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:52:56,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:52:56,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:52:56,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:52:56,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:52:56,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:52:56,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:52:56,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:52:56,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:52:56,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:52:56,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:52:56,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:52:56,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:52:56,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:52:56,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:52:56,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:52:56,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:52:56,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:52:56,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:52:56,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:52:56,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:52:56,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:52:56,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:52:56,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:52:56,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:52:56,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:52:56,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:52:56,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:52:56,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:52:56,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:52:56,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:52:56,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:52:56,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:52:56,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:52:56,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:52:56,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:52:56,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:52:56,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:52:56,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:52:56,113 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:52:56,145 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:52:56,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:52:56,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:52:56,146 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:52:56,147 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:52:56,147 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:52:56,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:52:56,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:52:56,149 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:52:56,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:52:56,150 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:52:56,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:52:56,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:52:56,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:52:56,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:52:56,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:52:56,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:52:56,152 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:52:56,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:52:56,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:52:56,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:52:56,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:52:56,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:52:56,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:52:56,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:52:56,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:52:56,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:52:56,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:52:56,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:52:56,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:52:56,155 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:52:56,155 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:52:56,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:52:56,156 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_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/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_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2022-11-20 10:52:56,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:52:56,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:52:56,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:52:56,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:52:56,497 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:52:56,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-11-20 10:52:59,536 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:52:59,804 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:52:59,805 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2022-11-20 10:52:59,818 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/data/87c137f36/ff84041785d044a4921b790c7535488b/FLAG87b013768 [2022-11-20 10:52:59,833 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/data/87c137f36/ff84041785d044a4921b790c7535488b [2022-11-20 10:52:59,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:52:59,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:52:59,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:52:59,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:52:59,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:52:59,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:52:59" (1/1) ... [2022-11-20 10:52:59,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f0b608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:52:59, skipping insertion in model container [2022-11-20 10:52:59,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:52:59" (1/1) ... [2022-11-20 10:52:59,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:52:59,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:53:00,367 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2022-11-20 10:53:00,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:53:00,435 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:53:00,474 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2022-11-20 10:53:00,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:53:00,543 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:53:00,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00 WrapperNode [2022-11-20 10:53:00,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:53:00,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:53:00,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:53:00,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:53:00,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,629 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2022-11-20 10:53:00,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:53:00,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:53:00,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:53:00,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:53:00,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,703 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:53:00,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:53:00,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:53:00,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:53:00,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (1/1) ... [2022-11-20 10:53:00,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:53:00,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:00,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:53:00,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:53:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:53:00,812 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2022-11-20 10:53:00,813 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2022-11-20 10:53:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:53:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:53:00,813 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2022-11-20 10:53:00,813 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2022-11-20 10:53:00,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:53:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-11-20 10:53:00,816 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-11-20 10:53:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:53:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:53:00,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:53:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:53:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-11-20 10:53:00,817 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-11-20 10:53:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:53:00,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:53:00,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:53:00,997 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:53:00,999 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:53:01,442 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:53:01,455 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:53:01,459 INFO L300 CfgBuilder]: Removed 41 assume(true) statements. [2022-11-20 10:53:01,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:53:01 BoogieIcfgContainer [2022-11-20 10:53:01,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:53:01,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:53:01,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:53:01,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:53:01,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:52:59" (1/3) ... [2022-11-20 10:53:01,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370776ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:53:01, skipping insertion in model container [2022-11-20 10:53:01,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:53:00" (2/3) ... [2022-11-20 10:53:01,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370776ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:53:01, skipping insertion in model container [2022-11-20 10:53:01,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:53:01" (3/3) ... [2022-11-20 10:53:01,470 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2022-11-20 10:53:01,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:53:01,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:53:01,563 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:53:01,570 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;@73f5e9e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:53:01,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:53:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-20 10:53:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:53:01,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:01,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:01,584 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:01,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2022-11-20 10:53:01,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:01,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043153204] [2022-11-20 10:53:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:01,792 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-20 10:53:01,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:01,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043153204] [2022-11-20 10:53:01,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043153204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:01,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:01,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:53:01,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013615403] [2022-11-20 10:53:01,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:01,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:53:01,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:53:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:53:01,857 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:01,930 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2022-11-20 10:53:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:53:01,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 10:53:01,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:01,949 INFO L225 Difference]: With dead ends: 230 [2022-11-20 10:53:01,949 INFO L226 Difference]: Without dead ends: 107 [2022-11-20 10:53:01,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:53:01,965 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:01,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:53:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-20 10:53:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-20 10:53:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:53:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2022-11-20 10:53:02,034 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2022-11-20 10:53:02,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:02,034 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2022-11-20 10:53:02,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:53:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2022-11-20 10:53:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 10:53:02,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:02,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:02,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:53:02,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:02,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2022-11-20 10:53:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:02,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56820914] [2022-11-20 10:53:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:02,400 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-20 10:53:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:02,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56820914] [2022-11-20 10:53:02,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56820914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:02,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:02,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:53:02,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923455734] [2022-11-20 10:53:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:02,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:53:02,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:02,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:53:02,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:53:02,404 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:02,786 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2022-11-20 10:53:02,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:53:02,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-11-20 10:53:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:02,788 INFO L225 Difference]: With dead ends: 109 [2022-11-20 10:53:02,788 INFO L226 Difference]: Without dead ends: 106 [2022-11-20 10:53:02,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:53:02,790 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 242 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:02,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 133 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:53:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-20 10:53:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-20 10:53:02,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-20 10:53:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2022-11-20 10:53:02,811 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2022-11-20 10:53:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:02,813 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2022-11-20 10:53:02,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2022-11-20 10:53:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 10:53:02,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:02,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:02,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:53:02,815 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2022-11-20 10:53:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270573413] [2022-11-20 10:53:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:02,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:03,771 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-20 10:53:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:03,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270573413] [2022-11-20 10:53:03,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270573413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:03,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:03,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:53:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960415563] [2022-11-20 10:53:03,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:03,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:53:03,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:03,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:53:03,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:53:03,774 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:04,957 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2022-11-20 10:53:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:53:04,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-11-20 10:53:04,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:04,965 INFO L225 Difference]: With dead ends: 198 [2022-11-20 10:53:04,965 INFO L226 Difference]: Without dead ends: 192 [2022-11-20 10:53:04,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:53:04,972 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 533 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:04,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 157 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 10:53:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-20 10:53:05,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2022-11-20 10:53:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-20 10:53:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2022-11-20 10:53:05,007 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2022-11-20 10:53:05,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:05,008 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2022-11-20 10:53:05,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2022-11-20 10:53:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 10:53:05,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:05,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:05,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:53:05,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:05,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2022-11-20 10:53:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:05,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567874507] [2022-11-20 10:53:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:06,508 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-20 10:53:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:06,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567874507] [2022-11-20 10:53:06,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567874507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:06,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:06,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:53:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321147060] [2022-11-20 10:53:06,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:06,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:53:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:53:06,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:53:06,511 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:07,671 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2022-11-20 10:53:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:53:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-11-20 10:53:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:07,674 INFO L225 Difference]: With dead ends: 274 [2022-11-20 10:53:07,674 INFO L226 Difference]: Without dead ends: 271 [2022-11-20 10:53:07,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:53:07,676 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 322 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:07,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 225 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 10:53:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-20 10:53:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2022-11-20 10:53:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:53:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2022-11-20 10:53:07,726 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2022-11-20 10:53:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:07,727 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2022-11-20 10:53:07,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2022-11-20 10:53:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 10:53:07,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:07,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:07,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:53:07,730 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2022-11-20 10:53:07,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:07,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233392612] [2022-11-20 10:53:07,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:07,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:09,098 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-20 10:53:09,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:09,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233392612] [2022-11-20 10:53:09,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233392612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:09,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:09,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:53:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507392618] [2022-11-20 10:53:09,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:09,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:53:09,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:09,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:53:09,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:53:09,110 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:10,382 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2022-11-20 10:53:10,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:53:10,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-11-20 10:53:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:10,389 INFO L225 Difference]: With dead ends: 273 [2022-11-20 10:53:10,389 INFO L226 Difference]: Without dead ends: 270 [2022-11-20 10:53:10,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:53:10,391 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 346 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:10,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 247 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 10:53:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-20 10:53:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2022-11-20 10:53:10,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:53:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2022-11-20 10:53:10,443 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2022-11-20 10:53:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:10,444 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2022-11-20 10:53:10,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2022-11-20 10:53:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 10:53:10,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:10,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:10,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:53:10,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:10,446 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2022-11-20 10:53:10,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:10,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113627036] [2022-11-20 10:53:10,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:10,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:11,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:12,210 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-20 10:53:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:12,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113627036] [2022-11-20 10:53:12,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113627036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:12,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:12,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:53:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458668823] [2022-11-20 10:53:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:12,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:53:12,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:53:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:53:12,213 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:13,743 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2022-11-20 10:53:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:53:13,744 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-11-20 10:53:13,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:13,745 INFO L225 Difference]: With dead ends: 272 [2022-11-20 10:53:13,745 INFO L226 Difference]: Without dead ends: 269 [2022-11-20 10:53:13,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:53:13,747 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 340 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:13,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 271 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 10:53:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-20 10:53:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2022-11-20 10:53:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:53:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2022-11-20 10:53:13,810 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2022-11-20 10:53:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:13,811 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2022-11-20 10:53:13,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2022-11-20 10:53:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:53:13,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:13,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:13,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:53:13,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:13,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2022-11-20 10:53:13,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:13,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341580059] [2022-11-20 10:53:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:13,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:15,626 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-20 10:53:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:15,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341580059] [2022-11-20 10:53:15,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341580059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:15,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:15,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:53:15,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377029988] [2022-11-20 10:53:15,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:15,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:53:15,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:15,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:53:15,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:53:15,628 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:17,068 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2022-11-20 10:53:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 10:53:17,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-11-20 10:53:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:17,070 INFO L225 Difference]: With dead ends: 271 [2022-11-20 10:53:17,070 INFO L226 Difference]: Without dead ends: 268 [2022-11-20 10:53:17,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:53:17,072 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 333 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:17,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 271 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 10:53:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-20 10:53:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2022-11-20 10:53:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:53:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2022-11-20 10:53:17,116 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2022-11-20 10:53:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:17,116 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2022-11-20 10:53:17,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2022-11-20 10:53:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 10:53:17,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:17,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:17,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:53:17,118 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:17,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2022-11-20 10:53:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:17,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492931825] [2022-11-20 10:53:17,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:18,060 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-20 10:53:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:18,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492931825] [2022-11-20 10:53:18,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492931825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:18,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:18,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 10:53:18,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308945583] [2022-11-20 10:53:18,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:18,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:53:18,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:53:18,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:53:18,063 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:19,307 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2022-11-20 10:53:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 10:53:19,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-11-20 10:53:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:19,309 INFO L225 Difference]: With dead ends: 270 [2022-11-20 10:53:19,309 INFO L226 Difference]: Without dead ends: 267 [2022-11-20 10:53:19,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:53:19,311 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 424 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:19,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 250 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 10:53:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-11-20 10:53:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2022-11-20 10:53:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-20 10:53:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2022-11-20 10:53:19,379 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2022-11-20 10:53:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:19,381 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2022-11-20 10:53:19,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2022-11-20 10:53:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 10:53:19,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:19,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:19,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:53:19,384 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:19,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2022-11-20 10:53:19,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:19,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111982420] [2022-11-20 10:53:19,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:19,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:21,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:21,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:53:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:21,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:53:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111982420] [2022-11-20 10:53:21,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111982420] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:21,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533896913] [2022-11-20 10:53:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:21,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:21,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:21,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:21,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:53:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:22,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-20 10:53:22,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:22,320 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:53:22,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 10:53:22,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:53:22,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 10:53:22,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 10:53:22,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:53:22,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:22,740 INFO L321 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2022-11-20 10:53:22,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 143 [2022-11-20 10:53:22,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 97 [2022-11-20 10:53:22,758 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 7 [2022-11-20 10:53:22,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2022-11-20 10:53:22,786 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:53:22,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2022-11-20 10:53:22,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2022-11-20 10:53:22,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:53:22,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:22,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-20 10:53:22,915 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:53:22,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-20 10:53:22,931 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-20 10:53:22,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 26 [2022-11-20 10:53:23,022 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:53:23,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:53:23,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-20 10:53:23,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-20 10:53:23,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-11-20 10:53:23,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 10:53:23,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2022-11-20 10:53:23,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-11-20 10:53:23,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:23,291 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:53:23,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2022-11-20 10:53:23,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:23,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-20 10:53:23,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-20 10:53:23,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:23,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-11-20 10:53:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:53:23,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:24,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533896913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:24,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:53:24,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2022-11-20 10:53:24,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215739534] [2022-11-20 10:53:24,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:53:24,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 10:53:24,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:24,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 10:53:24,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=820, Unknown=13, NotChecked=0, Total=930 [2022-11-20 10:53:24,225 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:53:27,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:27,858 INFO L93 Difference]: Finished difference Result 369 states and 437 transitions. [2022-11-20 10:53:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:53:27,859 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-11-20 10:53:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:27,863 INFO L225 Difference]: With dead ends: 369 [2022-11-20 10:53:27,864 INFO L226 Difference]: Without dead ends: 366 [2022-11-20 10:53:27,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=206, Invalid=1502, Unknown=14, NotChecked=0, Total=1722 [2022-11-20 10:53:27,867 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 755 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:27,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 654 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2891 Invalid, 0 Unknown, 92 Unchecked, 2.7s Time] [2022-11-20 10:53:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-20 10:53:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 338. [2022-11-20 10:53:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 295 states have (on average 1.2203389830508475) internal successors, (360), 311 states have internal predecessors, (360), 33 states have call successors, (33), 11 states have call predecessors, (33), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-20 10:53:27,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 408 transitions. [2022-11-20 10:53:27,932 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 408 transitions. Word has length 40 [2022-11-20 10:53:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:27,933 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 408 transitions. [2022-11-20 10:53:27,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 17 states have internal predecessors, (55), 5 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 10:53:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 408 transitions. [2022-11-20 10:53:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-20 10:53:27,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:27,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:27,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:53:28,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:28,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:28,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2022-11-20 10:53:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:28,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960900502] [2022-11-20 10:53:28,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:29,744 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-20 10:53:29,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:29,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960900502] [2022-11-20 10:53:29,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960900502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:53:29,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:53:29,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 10:53:29,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053118755] [2022-11-20 10:53:29,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:53:29,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 10:53:29,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:29,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 10:53:29,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:53:29,747 INFO L87 Difference]: Start difference. First operand 338 states and 408 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:31,422 INFO L93 Difference]: Finished difference Result 351 states and 419 transitions. [2022-11-20 10:53:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:53:31,423 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-11-20 10:53:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:31,425 INFO L225 Difference]: With dead ends: 351 [2022-11-20 10:53:31,425 INFO L226 Difference]: Without dead ends: 348 [2022-11-20 10:53:31,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-11-20 10:53:31,426 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 379 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:31,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 295 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 10:53:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-20 10:53:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 338. [2022-11-20 10:53:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 295 states have (on average 1.2169491525423728) internal successors, (359), 311 states have internal predecessors, (359), 33 states have call successors, (33), 11 states have call predecessors, (33), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-20 10:53:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 407 transitions. [2022-11-20 10:53:31,489 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 407 transitions. Word has length 42 [2022-11-20 10:53:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:31,489 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 407 transitions. [2022-11-20 10:53:31,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:53:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 407 transitions. [2022-11-20 10:53:31,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-20 10:53:31,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:31,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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-20 10:53:31,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:53:31,491 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2022-11-20 10:53:31,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:31,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025837926] [2022-11-20 10:53:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:32,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-20 10:53:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 10:53:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:53:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:53:33,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025837926] [2022-11-20 10:53:33,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025837926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:33,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095045105] [2022-11-20 10:53:33,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:33,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:53:33,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:53:33,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:53:33,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:53:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:53:33,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 152 conjunts are in the unsatisfiable core [2022-11-20 10:53:33,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:53:33,808 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:53:33,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 10:53:33,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:53:33,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:53:33,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:53:33,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-20 10:53:34,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:34,191 INFO L321 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2022-11-20 10:53:34,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 138 [2022-11-20 10:53:34,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 94 [2022-11-20 10:53:34,209 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 7 [2022-11-20 10:53:34,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2022-11-20 10:53:34,240 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 10:53:34,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2022-11-20 10:53:34,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:34,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-11-20 10:53:34,387 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-20 10:53:34,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 49 [2022-11-20 10:53:34,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 10:53:34,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:34,422 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 21 treesize of output 23 [2022-11-20 10:53:34,545 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:53:34,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 10:53:34,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-20 10:53:34,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:53:34,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-20 10:53:34,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-20 10:53:34,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 42 [2022-11-20 10:53:34,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2022-11-20 10:53:34,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:34,859 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:53:34,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-11-20 10:53:34,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:53:34,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-11-20 10:53:34,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 10:53:35,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 10:53:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:53:35,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:53:35,259 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1455 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1455) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)) 0))) is different from false [2022-11-20 10:53:35,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095045105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:53:35,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:53:35,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-11-20 10:53:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488278629] [2022-11-20 10:53:35,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 10:53:35,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 10:53:35,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:53:35,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 10:53:35,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=708, Unknown=3, NotChecked=54, Total=870 [2022-11-20 10:53:35,556 INFO L87 Difference]: Start difference. First operand 338 states and 407 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 17 states have internal predecessors, (68), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:53:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:53:39,014 INFO L93 Difference]: Finished difference Result 367 states and 433 transitions. [2022-11-20 10:53:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 10:53:39,015 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 17 states have internal predecessors, (68), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2022-11-20 10:53:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:53:39,017 INFO L225 Difference]: With dead ends: 367 [2022-11-20 10:53:39,017 INFO L226 Difference]: Without dead ends: 364 [2022-11-20 10:53:39,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=4, NotChecked=82, Total=1892 [2022-11-20 10:53:39,019 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1016 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:53:39,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 638 Invalid, 3254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2662 Invalid, 0 Unknown, 442 Unchecked, 2.5s Time] [2022-11-20 10:53:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-20 10:53:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 338. [2022-11-20 10:53:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 295 states have (on average 1.2135593220338983) internal successors, (358), 311 states have internal predecessors, (358), 33 states have call successors, (33), 11 states have call predecessors, (33), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-20 10:53:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 406 transitions. [2022-11-20 10:53:39,078 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 406 transitions. Word has length 43 [2022-11-20 10:53:39,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:53:39,078 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 406 transitions. [2022-11-20 10:53:39,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 17 states have internal predecessors, (68), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-20 10:53:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 406 transitions. [2022-11-20 10:53:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 10:53:39,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:53:39,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:39,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:53:39,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 10:53:39,290 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:53:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:53:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2001574846, now seen corresponding path program 1 times [2022-11-20 10:53:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:53:39,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030604479] [2022-11-20 10:53:39,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:53:39,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:53:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:39,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:53:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:53:39,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:53:39,393 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:53:39,394 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:53:39,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:53:39,401 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:53:39,405 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:53:39,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:53:39 BoogieIcfgContainer [2022-11-20 10:53:39,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:53:39,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:53:39,452 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:53:39,452 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:53:39,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:53:01" (3/4) ... [2022-11-20 10:53:39,461 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:53:39,521 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:53:39,522 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:53:39,522 INFO L158 Benchmark]: Toolchain (without parser) took 39684.82ms. Allocated memory was 148.9MB in the beginning and 453.0MB in the end (delta: 304.1MB). Free memory was 104.9MB in the beginning and 217.2MB in the end (delta: -112.3MB). Peak memory consumption was 193.2MB. Max. memory is 16.1GB. [2022-11-20 10:53:39,522 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:53:39,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.04ms. Allocated memory is still 148.9MB. Free memory was 104.4MB in the beginning and 77.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-20 10:53:39,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.15ms. Allocated memory is still 148.9MB. Free memory was 77.6MB in the beginning and 75.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:53:39,525 INFO L158 Benchmark]: Boogie Preprocessor took 78.57ms. Allocated memory is still 148.9MB. Free memory was 75.1MB in the beginning and 72.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:53:39,526 INFO L158 Benchmark]: RCFGBuilder took 751.69ms. Allocated memory is still 148.9MB. Free memory was 72.3MB in the beginning and 109.7MB in the end (delta: -37.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-11-20 10:53:39,526 INFO L158 Benchmark]: TraceAbstraction took 37988.13ms. Allocated memory was 148.9MB in the beginning and 453.0MB in the end (delta: 304.1MB). Free memory was 108.9MB in the beginning and 220.4MB in the end (delta: -111.4MB). Peak memory consumption was 192.3MB. Max. memory is 16.1GB. [2022-11-20 10:53:39,526 INFO L158 Benchmark]: Witness Printer took 69.68ms. Allocated memory is still 453.0MB. Free memory was 220.4MB in the beginning and 217.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:53:39,532 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 107.0MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.04ms. Allocated memory is still 148.9MB. Free memory was 104.4MB in the beginning and 77.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.15ms. Allocated memory is still 148.9MB. Free memory was 77.6MB in the beginning and 75.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.57ms. Allocated memory is still 148.9MB. Free memory was 75.1MB in the beginning and 72.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 751.69ms. Allocated memory is still 148.9MB. Free memory was 72.3MB in the beginning and 109.7MB in the end (delta: -37.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 37988.13ms. Allocated memory was 148.9MB in the beginning and 453.0MB in the end (delta: 304.1MB). Free memory was 108.9MB in the beginning and 220.4MB in the end (delta: -111.4MB). Peak memory consumption was 192.3MB. Max. memory is 16.1GB. * Witness Printer took 69.68ms. Allocated memory is still 453.0MB. Free memory was 220.4MB in the beginning and 217.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 840]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L850] struct list_head gl_list = { &(gl_list), &(gl_list) }; VAL [gl_list={3:0}] [L949] CALL gl_read() [L909] CALL gl_insert(__VERIFIER_nondet_int()) [L899] struct node *node = malloc(sizeof *node); [L900] COND FALSE !(!node) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L902] node->value = value VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L903] CALL list_add(&node->linkage, &gl_list) VAL [gl_list={3:0}] [L890] EXPR head->next [L890] CALL __list_add(new, head, head->next) [L878] next->prev = new [L879] new->next = next [L880] new->prev = prev [L881] prev->next = new VAL [gl_list={3:0}, new={-1:4}, new={-1:4}, next={3:0}, next={3:0}, prev={3:0}, prev={3:0}] [L890] RET __list_add(new, head, head->next) [L903] RET list_add(&node->linkage, &gl_list) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L904] (&node->nested)->next = (&node->nested) [L904] (&node->nested)->next = (&node->nested) VAL [\old(value)=5, gl_list={3:0}, node={-1:0}, value=5] [L909] RET gl_insert(__VERIFIER_nondet_int()) [L911] COND FALSE !(__VERIFIER_nondet_int()) [L949] RET gl_read() [L950] CALL inspect(&gl_list) VAL [gl_list={3:0}, head={3:0}] [L853] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={3:0}] [L854] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={3:0}, head->next={-1:4}] [L854] COND FALSE !(!(head->next != head)) [L855] EXPR head->prev VAL [gl_list={3:0}, head={3:0}, head={3:0}, head->prev={-1:4}] [L855] COND FALSE !(!(head->prev != head)) [L856] EXPR head->prev [L856] head = head->prev [L857] COND FALSE !(!(head)) VAL [gl_list={3:0}, head={3:0}, head={-1:4}] [L858] EXPR head->next VAL [gl_list={3:0}, head={3:0}, head={-1:4}, head->next={3:0}] [L858] COND FALSE !(!(head->next != head)) [L859] EXPR head->prev VAL [gl_list={3:0}, head={-1:4}, head={3:0}, head->prev={3:0}] [L859] COND FALSE !(!(head->prev != head)) [L860] const struct node *node = ((struct node *)((char *)(head)-(unsigned long)(&((struct node *)0)->linkage))); VAL [gl_list={3:0}, head={-1:4}, head={3:0}, node={-1:0}] [L861] COND FALSE !(!(node)) VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}] [L862] EXPR node->nested.next VAL [gl_list={3:0}, head={-1:4}, head={3:0}, node={-1:0}, node->nested.next={-1:12}] [L862] COND FALSE !(!(node->nested.next == &node->nested)) [L863] EXPR node->nested.prev VAL [gl_list={3:0}, head={3:0}, head={-1:4}, node={-1:0}, node->nested.prev={55:53}] [L863] COND TRUE !(node->nested.prev == &node->nested) [L863] CALL fail() VAL [gl_list={3:0}] [L840] reach_error() VAL [gl_list={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.9s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4720 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4690 mSDsluCounter, 3277 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 534 IncrementalHoareTripleChecker+Unchecked, 2769 mSDsCounter, 685 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12878 IncrementalHoareTripleChecker+Invalid, 14097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 685 mSolverCounterUnsat, 508 mSDtfsCounter, 12878 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 213 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=9, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 164 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 414 ConstructedInterpolants, 14 QuantifiedInterpolants, 10063 SizeOfPredicates, 89 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 2/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-20 10:53:39,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5c414be-9276-408e-a01d-ec878067dc87/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE