./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a --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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- 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-b5237d8 [2022-11-21 17:06:58,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:06:58,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:06:58,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:06:58,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:06:58,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:06:58,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:06:58,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:06:58,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:06:58,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:06:58,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:06:58,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:06:58,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:06:58,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:06:58,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:06:58,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:06:58,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:06:58,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:06:58,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:06:58,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:06:58,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:06:58,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:06:58,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:06:58,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:06:58,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:06:58,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:06:58,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:06:58,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:06:58,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:06:58,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:06:58,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:06:58,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:06:58,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:06:58,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:06:58,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:06:58,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:06:58,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:06:58,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:06:58,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:06:58,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:06:58,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:06:58,133 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 17:06:58,159 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:06:58,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:06:58,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:06:58,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:06:58,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:06:58,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:06:58,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:06:58,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:06:58,163 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:06:58,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:06:58,163 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:06:58,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:06:58,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:06:58,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:06:58,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:06:58,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:06:58,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:06:58,166 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:06:58,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:06:58,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:06:58,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:06:58,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:06:58,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:06:58,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:06:58,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:06:58,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:06:58,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:06:58,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:06:58,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:06:58,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:06:58,175 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:06:58,175 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:06:58,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:06:58,178 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_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/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_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a 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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2022-11-21 17:06:58,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:06:58,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:06:58,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:06:58,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:06:58,607 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:06:58,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-11-21 17:07:01,759 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:07:02,028 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:07:02,029 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-11-21 17:07:02,046 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/data/2178eaad7/3d400893ab274f399605ccde41bba59e/FLAGa7a1f5060 [2022-11-21 17:07:02,066 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/data/2178eaad7/3d400893ab274f399605ccde41bba59e [2022-11-21 17:07:02,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:07:02,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:07:02,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:07:02,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:07:02,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:07:02,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c2f507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02, skipping insertion in model container [2022-11-21 17:07:02,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:07:02,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:07:02,570 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_401389ad-10c5-4ddf-9fda-cc4252c75bef/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-11-21 17:07:02,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:07:02,596 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:07:02,680 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_401389ad-10c5-4ddf-9fda-cc4252c75bef/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-11-21 17:07:02,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:07:02,717 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:07:02,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02 WrapperNode [2022-11-21 17:07:02,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:07:02,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:07:02,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:07:02,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:07:02,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,798 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 148 [2022-11-21 17:07:02,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:07:02,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:07:02,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:07:02,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:07:02,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,832 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:07:02,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:07:02,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:07:02,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:07:02,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (1/1) ... [2022-11-21 17:07:02,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:07:02,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:02,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:07:02,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:07:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:07:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:07:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-21 17:07:02,936 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-21 17:07:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 17:07:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:07:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 17:07:02,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 17:07:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 17:07:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:07:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 17:07:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:07:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:07:02,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:07:03,149 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:07:03,166 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:07:03,487 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:07:03,498 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:07:03,498 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-21 17:07:03,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:07:03 BoogieIcfgContainer [2022-11-21 17:07:03,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:07:03,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:07:03,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:07:03,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:07:03,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:07:02" (1/3) ... [2022-11-21 17:07:03,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d0ef64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:07:03, skipping insertion in model container [2022-11-21 17:07:03,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:02" (2/3) ... [2022-11-21 17:07:03,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d0ef64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:07:03, skipping insertion in model container [2022-11-21 17:07:03,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:07:03" (3/3) ... [2022-11-21 17:07:03,541 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-11-21 17:07:03,570 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:07:03,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 17:07:03,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:07:03,674 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;@13d5aefe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:07:03,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 17:07:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:07:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 17:07:03,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:03,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:07:03,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -246443823, now seen corresponding path program 1 times [2022-11-21 17:07:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:03,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506235199] [2022-11-21 17:07:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:03,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:07:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:04,082 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-21 17:07:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:04,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506235199] [2022-11-21 17:07:04,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506235199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:04,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:04,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:07:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770055637] [2022-11-21 17:07:04,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:04,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:07:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:04,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:07:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:07:04,145 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:07:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:04,268 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2022-11-21 17:07:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:07:04,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-21 17:07:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:04,279 INFO L225 Difference]: With dead ends: 62 [2022-11-21 17:07:04,280 INFO L226 Difference]: Without dead ends: 28 [2022-11-21 17:07:04,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:07:04,296 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:04,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:07:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-21 17:07:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-21 17:07:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:07:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-11-21 17:07:04,348 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2022-11-21 17:07:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:04,350 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-21 17:07:04,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:07:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-11-21 17:07:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-21 17:07:04,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:04,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:07:04,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:07:04,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:04,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:04,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1738034235, now seen corresponding path program 1 times [2022-11-21 17:07:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:04,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640119125] [2022-11-21 17:07:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 17:07:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:04,643 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-21 17:07:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:04,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640119125] [2022-11-21 17:07:04,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640119125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:04,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:04,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:07:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828896631] [2022-11-21 17:07:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:04,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:07:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:07:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:07:04,648 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:07:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:04,750 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-11-21 17:07:04,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:07:04,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-21 17:07:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:04,752 INFO L225 Difference]: With dead ends: 54 [2022-11-21 17:07:04,754 INFO L226 Difference]: Without dead ends: 32 [2022-11-21 17:07:04,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:07:04,756 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:04,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:07:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-21 17:07:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-11-21 17:07:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:07:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-11-21 17:07:04,772 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2022-11-21 17:07:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:04,772 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-11-21 17:07:04,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 17:07:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-11-21 17:07:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 17:07:04,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:04,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:07:04,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:07:04,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1368908325, now seen corresponding path program 1 times [2022-11-21 17:07:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:04,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823034253] [2022-11-21 17:07:04,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:04,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 17:07:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:07:05,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:05,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823034253] [2022-11-21 17:07:05,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823034253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:05,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872739493] [2022-11-21 17:07:05,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:05,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:05,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:05,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:05,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:07:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:07:05,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:05,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:07:05,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:07:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:07:05,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872739493] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:07:05,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:07:05,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-21 17:07:05,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145138955] [2022-11-21 17:07:05,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:07:05,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:07:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:07:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:05,393 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 17:07:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:05,495 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2022-11-21 17:07:05,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:07:05,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-21 17:07:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:05,497 INFO L225 Difference]: With dead ends: 55 [2022-11-21 17:07:05,497 INFO L226 Difference]: Without dead ends: 33 [2022-11-21 17:07:05,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:05,499 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:05,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:07:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-21 17:07:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-21 17:07:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:07:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-11-21 17:07:05,507 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 28 [2022-11-21 17:07:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:05,507 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-11-21 17:07:05,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 17:07:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-11-21 17:07:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 17:07:05,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:05,509 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:07:05,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:05,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:05,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:05,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1136271419, now seen corresponding path program 2 times [2022-11-21 17:07:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:05,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257750590] [2022-11-21 17:07:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:07:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 17:07:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 17:07:05,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:05,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257750590] [2022-11-21 17:07:05,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257750590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:05,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:05,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:07:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644437759] [2022-11-21 17:07:05,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:05,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:07:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:07:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:07:05,975 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:07:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:06,029 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-11-21 17:07:06,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:07:06,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-11-21 17:07:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:06,032 INFO L225 Difference]: With dead ends: 57 [2022-11-21 17:07:06,032 INFO L226 Difference]: Without dead ends: 46 [2022-11-21 17:07:06,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:07:06,034 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:06,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:07:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-21 17:07:06,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-11-21 17:07:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:07:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-11-21 17:07:06,044 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 37 [2022-11-21 17:07:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:06,044 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-11-21 17:07:06,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 17:07:06,045 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-11-21 17:07:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 17:07:06,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:06,046 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:07:06,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:07:06,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:06,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1079013117, now seen corresponding path program 1 times [2022-11-21 17:07:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:06,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143786515] [2022-11-21 17:07:06,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:06,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:06,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:06,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:07:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:06,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 17:07:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 17:07:06,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:06,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143786515] [2022-11-21 17:07:06,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143786515] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:06,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080828664] [2022-11-21 17:07:06,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:06,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:06,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:06,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:06,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:07:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:06,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 17:07:06,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 17:07:06,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:07:06,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080828664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:06,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:07:06,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-11-21 17:07:06,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917817728] [2022-11-21 17:07:06,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:06,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:07:06,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:06,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:07:06,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:06,717 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:07:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:06,761 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-11-21 17:07:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:07:06,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-21 17:07:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:06,768 INFO L225 Difference]: With dead ends: 46 [2022-11-21 17:07:06,768 INFO L226 Difference]: Without dead ends: 34 [2022-11-21 17:07:06,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:06,772 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:06,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 70 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:07:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-21 17:07:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-21 17:07:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:07:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-11-21 17:07:06,792 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 37 [2022-11-21 17:07:06,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:06,793 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-11-21 17:07:06,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:07:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-11-21 17:07:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 17:07:06,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:06,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:07:06,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:07,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:07,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:07,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:07,003 INFO L85 PathProgramCache]: Analyzing trace with hash -300753136, now seen corresponding path program 1 times [2022-11-21 17:07:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:07,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070821016] [2022-11-21 17:07:07,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:07,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:08,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:08,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:07:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:09,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 17:07:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:07:09,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:09,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070821016] [2022-11-21 17:07:09,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070821016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:09,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597681920] [2022-11-21 17:07:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:09,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:09,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:09,603 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:09,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:07:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:09,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-21 17:07:09,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:10,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 17:07:10,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:07:10,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-21 17:07:10,779 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 34 treesize of output 22 [2022-11-21 17:07:10,791 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 3 [2022-11-21 17:07:10,800 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-21 17:07:10,808 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-21 17:07:11,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:11,187 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 40 treesize of output 38 [2022-11-21 17:07:11,206 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:07:11,207 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 15 treesize of output 15 [2022-11-21 17:07:11,219 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 22 treesize of output 24 [2022-11-21 17:07:11,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:11,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-11-21 17:07:11,701 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:07:11,702 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 93 treesize of output 84 [2022-11-21 17:07:11,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2022-11-21 17:07:11,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:11,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2022-11-21 17:07:11,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:11,856 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 56 treesize of output 52 [2022-11-21 17:07:11,870 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 22 treesize of output 24 [2022-11-21 17:07:11,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:11,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:11,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2022-11-21 17:07:11,986 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 49 treesize of output 33 [2022-11-21 17:07:11,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:11,994 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2022-11-21 17:07:12,072 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-21 17:07:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:07:12,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:07:12,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_623) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-21 17:07:12,967 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_616 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_616)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_623) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-21 17:07:13,601 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_616 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 v_ArrVal_616)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_623) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-21 17:07:14,523 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_616 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_616)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_623) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_620) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-21 17:07:14,679 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_633 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (v_ArrVal_616 Int) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_621 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| Int) (v_ArrVal_631 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_633)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_631))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (+ (select (select .cse4 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_632))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_616))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_623) (select (select (store (store .cse3 .cse1 v_ArrVal_620) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_621) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11| v_ArrVal_622) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_11|) 0)))) is different from false [2022-11-21 17:07:14,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597681920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:14,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:07:14,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2022-11-21 17:07:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392858224] [2022-11-21 17:07:14,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:07:14,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-21 17:07:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 17:07:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1032, Unknown=5, NotChecked=340, Total=1482 [2022-11-21 17:07:14,686 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:07:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:16,408 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2022-11-21 17:07:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:07:16,409 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-11-21 17:07:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:16,410 INFO L225 Difference]: With dead ends: 55 [2022-11-21 17:07:16,410 INFO L226 Difference]: Without dead ends: 53 [2022-11-21 17:07:16,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=226, Invalid=1951, Unknown=5, NotChecked=470, Total=2652 [2022-11-21 17:07:16,413 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 171 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:16,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 219 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 17:07:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-21 17:07:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-11-21 17:07:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:07:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-11-21 17:07:16,426 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 38 [2022-11-21 17:07:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:16,426 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-11-21 17:07:16,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:07:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-11-21 17:07:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 17:07:16,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:16,428 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:07:16,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:16,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-21 17:07:16,637 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash -243494834, now seen corresponding path program 1 times [2022-11-21 17:07:16,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:16,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32492720] [2022-11-21 17:07:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:16,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:07:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 17:07:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:07:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:17,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32492720] [2022-11-21 17:07:17,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32492720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:17,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203209595] [2022-11-21 17:07:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:17,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:17,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:17,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:07:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-21 17:07:17,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:17,798 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 17 treesize of output 9 [2022-11-21 17:07:17,860 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_794 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_794))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-11-21 17:07:17,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:17,885 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 24 treesize of output 24 [2022-11-21 17:07:17,943 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 25 treesize of output 13 [2022-11-21 17:07:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-11-21 17:07:18,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:07:18,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203209595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:18,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:07:18,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-11-21 17:07:18,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419263384] [2022-11-21 17:07:18,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:07:18,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-21 17:07:18,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:18,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-21 17:07:18,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=572, Unknown=2, NotChecked=48, Total=702 [2022-11-21 17:07:18,237 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:07:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:19,091 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2022-11-21 17:07:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 17:07:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-11-21 17:07:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:19,095 INFO L225 Difference]: With dead ends: 60 [2022-11-21 17:07:19,095 INFO L226 Difference]: Without dead ends: 49 [2022-11-21 17:07:19,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=954, Unknown=2, NotChecked=64, Total=1190 [2022-11-21 17:07:19,097 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 216 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:19,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 303 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 282 Invalid, 0 Unknown, 40 Unchecked, 0.4s Time] [2022-11-21 17:07:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-21 17:07:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-11-21 17:07:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:07:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-11-21 17:07:19,120 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 38 [2022-11-21 17:07:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:19,120 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-11-21 17:07:19,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.130434782608696) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-21 17:07:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-11-21 17:07:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 17:07:19,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:19,123 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:07:19,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:19,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:19,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash -733467546, now seen corresponding path program 1 times [2022-11-21 17:07:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:19,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901160818] [2022-11-21 17:07:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:20,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:20,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:07:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:20,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 17:07:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:07:20,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:20,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901160818] [2022-11-21 17:07:20,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901160818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:20,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753478917] [2022-11-21 17:07:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:20,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:20,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:20,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:20,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:07:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:20,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-21 17:07:20,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:21,011 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-21 17:07:21,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:21,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-21 17:07:21,474 INFO L321 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2022-11-21 17:07:21,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2022-11-21 17:07:22,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:07:22,294 INFO L321 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2022-11-21 17:07:22,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 79 treesize of output 155 [2022-11-21 17:07:23,658 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-21 17:07:33,894 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-21 17:07:34,035 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-21 17:07:34,421 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:07:35,059 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:07:50,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 17:07:50,592 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-21 17:07:50,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 17:07:51,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 17:07:56,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 17:07:56,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-21 17:07:57,469 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-21 17:07:57,701 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 16 treesize of output 8 [2022-11-21 17:07:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:07:57,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:07:57,814 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_961 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) (<= 1 |c_ULTIMATE.start_main_~mid_index~0#1|)) is different from false [2022-11-21 17:08:01,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753478917] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:08:01,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:08:01,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2022-11-21 17:08:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921483334] [2022-11-21 17:08:01,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 17:08:01,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-21 17:08:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:08:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-21 17:08:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1207, Unknown=14, NotChecked=70, Total=1406 [2022-11-21 17:08:01,551 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 33 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 27 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 17:08:15,821 WARN L233 SmtUtils]: Spent 8.43s on a formula simplification. DAG size of input: 73 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:08:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:08:16,370 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-11-21 17:08:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 17:08:16,371 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 27 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-11-21 17:08:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:08:16,372 INFO L225 Difference]: With dead ends: 61 [2022-11-21 17:08:16,372 INFO L226 Difference]: Without dead ends: 54 [2022-11-21 17:08:16,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=362, Invalid=2280, Unknown=14, NotChecked=100, Total=2756 [2022-11-21 17:08:16,374 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 405 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:08:16,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 272 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:08:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-21 17:08:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2022-11-21 17:08:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:08:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-11-21 17:08:16,407 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 39 [2022-11-21 17:08:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:08:16,410 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-11-21 17:08:16,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 27 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 17:08:16,411 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-11-21 17:08:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 17:08:16,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:08:16,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:08:16,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:08:16,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:08:16,621 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:08:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:08:16,622 INFO L85 PathProgramCache]: Analyzing trace with hash -169490139, now seen corresponding path program 2 times [2022-11-21 17:08:16,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:08:16,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272088105] [2022-11-21 17:08:16,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:08:16,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:08:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:08:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:16,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:08:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:16,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 17:08:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 17:08:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:08:16,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272088105] [2022-11-21 17:08:16,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272088105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:08:16,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201181967] [2022-11-21 17:08:16,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 17:08:16,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:08:16,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:08:16,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:08:16,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:08:17,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 17:08:17,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 17:08:17,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 17:08:17,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:08:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 17:08:17,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:08:17,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201181967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:08:17,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:08:17,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-21 17:08:17,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827141516] [2022-11-21 17:08:17,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:08:17,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:08:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:08:17,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:08:17,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:08:17,260 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:08:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:08:17,322 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-11-21 17:08:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:08:17,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-11-21 17:08:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:08:17,324 INFO L225 Difference]: With dead ends: 50 [2022-11-21 17:08:17,325 INFO L226 Difference]: Without dead ends: 36 [2022-11-21 17:08:17,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:08:17,329 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:08:17,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 53 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:08:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-21 17:08:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-21 17:08:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:08:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-11-21 17:08:17,357 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 39 [2022-11-21 17:08:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:08:17,357 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-11-21 17:08:17,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:08:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-11-21 17:08:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 17:08:17,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:08:17,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:08:17,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:08:17,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-21 17:08:17,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:08:17,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:08:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1260942485, now seen corresponding path program 1 times [2022-11-21 17:08:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:08:17,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73368378] [2022-11-21 17:08:17,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:08:17,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:08:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:17,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:08:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:08:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:18,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 17:08:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 17:08:18,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:08:18,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73368378] [2022-11-21 17:08:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73368378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:08:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944184699] [2022-11-21 17:08:18,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:08:18,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:08:18,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:08:18,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:08:18,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:08:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:18,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 17:08:18,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:08:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 17:08:18,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:08:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 17:08:18,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944184699] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:08:18,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:08:18,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-11-21 17:08:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891444291] [2022-11-21 17:08:18,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:08:18,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 17:08:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:08:18,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 17:08:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-21 17:08:18,490 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 17:08:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:08:18,781 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-11-21 17:08:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:08:18,781 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-11-21 17:08:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:08:18,782 INFO L225 Difference]: With dead ends: 46 [2022-11-21 17:08:18,783 INFO L226 Difference]: Without dead ends: 37 [2022-11-21 17:08:18,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-11-21 17:08:18,784 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 84 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:08:18,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 145 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:08:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-21 17:08:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-11-21 17:08:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:08:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-21 17:08:18,799 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 40 [2022-11-21 17:08:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:08:18,799 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-21 17:08:18,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 14 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-21 17:08:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-21 17:08:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 17:08:18,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:08:18,801 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:08:18,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 17:08:19,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 17:08:19,004 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:08:19,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:08:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -434566293, now seen corresponding path program 1 times [2022-11-21 17:08:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:08:19,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441957513] [2022-11-21 17:08:19,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:08:19,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:08:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:21,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:08:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-21 17:08:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:21,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 17:08:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:08:21,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:08:21,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441957513] [2022-11-21 17:08:21,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441957513] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:08:21,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316132992] [2022-11-21 17:08:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:08:21,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:08:21,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:08:21,536 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:08:21,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_401389ad-10c5-4ddf-9fda-cc4252c75bef/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:08:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:08:22,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-21 17:08:22,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:08:22,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 17:08:22,570 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 19 treesize of output 11 [2022-11-21 17:08:22,575 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-21 17:08:22,581 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-21 17:08:22,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 17:08:22,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:08:22,833 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-21 17:08:22,850 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-21 17:08:22,850 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 15 treesize of output 15 [2022-11-21 17:08:22,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:08:22,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-21 17:08:23,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:08:23,269 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 78 treesize of output 56 [2022-11-21 17:08:23,279 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-21 17:08:23,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:08:23,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2022-11-21 17:08:23,464 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:08:23,467 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 137 [2022-11-21 17:08:23,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:08:23,503 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-21 17:08:23,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 145 [2022-11-21 17:08:23,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2022-11-21 17:08:23,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:08:23,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:08:23,829 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 54 [2022-11-21 17:08:23,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:08:23,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 18 [2022-11-21 17:08:23,966 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-21 17:08:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 17:08:23,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:08:24,053 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1457 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1456)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1458))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1457)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) is different from false [2022-11-21 17:08:24,084 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1457 Int) (v_ArrVal_1450 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse5 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1456)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1458))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1450))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1457))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-21 17:08:24,116 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1457 Int) (v_ArrVal_1450 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse5 (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1456)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1458))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1450))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1457))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-21 17:08:24,136 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1456 (Array Int Int)) (v_ArrVal_1457 Int) (v_ArrVal_1450 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) 4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1456)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1458))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1450))) (store .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) v_ArrVal_1457))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) is different from false [2022-11-21 17:08:24,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:08:24,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 312 [2022-11-21 17:08:24,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:08:24,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4984 treesize of output 4708 [2022-11-21 17:08:24,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5116 treesize of output 4436 [2022-11-21 17:08:25,003 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 1291 treesize of output 1155 [2022-11-21 17:10:21,766 WARN L233 SmtUtils]: Spent 1.95m on a formula simplification that was a NOOP. DAG size: 371 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-21 17:10:21,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:10:21,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 3808 treesize of output 11446