./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 2329fc70 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_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 13:27:28,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:27:28,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:27:28,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:27:28,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:27:28,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:27:28,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:27:28,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:27:28,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:27:28,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:27:28,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:27:28,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:27:28,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:27:28,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:27:28,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:27:28,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:27:28,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:27:28,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:27:29,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:27:29,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:27:29,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:27:29,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:27:29,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:27:29,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:27:29,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:27:29,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:27:29,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:27:29,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:27:29,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:27:29,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:27:29,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:27:29,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:27:29,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:27:29,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:27:29,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:27:29,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:27:29,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:27:29,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:27:29,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:27:29,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:27:29,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:27:29,013 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:27:29,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:27:29,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:27:29,027 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:27:29,027 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:27:29,028 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:27:29,028 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:27:29,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:27:29,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:27:29,029 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:27:29,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:27:29,029 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:27:29,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:27:29,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:27:29,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:27:29,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:27:29,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:27:29,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:27:29,030 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:27:29,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:27:29,030 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:27:29,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:27:29,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:27:29,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:27:29,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:27:29,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:27:29,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:27:29,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:27:29,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:27:29,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:27:29,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:27:29,031 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:27:29,031 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:27:29,032 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:27:29,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:27:29,032 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:27:29,032 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/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_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8 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-12-13 13:27:29,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:27:29,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:27:29,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:27:29,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:27:29,240 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:27:29,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-12-13 13:27:31,722 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:27:31,930 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:27:31,931 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2022-12-13 13:27:31,939 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/data/5cc5b4fb0/237dafe9eb4e49aea2a4fa14f4eb97f0/FLAGb3504dcd1 [2022-12-13 13:27:32,282 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/data/5cc5b4fb0/237dafe9eb4e49aea2a4fa14f4eb97f0 [2022-12-13 13:27:32,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:27:32,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:27:32,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:27:32,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:27:32,293 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:27:32,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3d083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32, skipping insertion in model container [2022-12-13 13:27:32,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:27:32,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:27:32,571 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_dfdc08b9-dc73-44b8-8f66-e35428d83310/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-12-13 13:27:32,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:27:32,584 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:27:32,617 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_dfdc08b9-dc73-44b8-8f66-e35428d83310/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2022-12-13 13:27:32,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:27:32,634 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:27:32,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32 WrapperNode [2022-12-13 13:27:32,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:27:32,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:27:32,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:27:32,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:27:32,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,665 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 148 [2022-12-13 13:27:32,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:27:32,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:27:32,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:27:32,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:27:32,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:27:32,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:27:32,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:27:32,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:27:32,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (1/1) ... [2022-12-13 13:27:32,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:27:32,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:32,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:27:32,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:27:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:27:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:27:32,746 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 13:27:32,746 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 13:27:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:27:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:27:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:27:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 13:27:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 13:27:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:27:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 13:27:32,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:27:32,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:27:32,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:27:32,841 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:27:32,842 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:27:33,032 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:27:33,036 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:27:33,036 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 13:27:33,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:33 BoogieIcfgContainer [2022-12-13 13:27:33,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:27:33,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:27:33,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:27:33,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:27:33,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:27:32" (1/3) ... [2022-12-13 13:27:33,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e0ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:27:33, skipping insertion in model container [2022-12-13 13:27:33,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:32" (2/3) ... [2022-12-13 13:27:33,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e0ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:27:33, skipping insertion in model container [2022-12-13 13:27:33,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:33" (3/3) ... [2022-12-13 13:27:33,044 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-12-13 13:27:33,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:27:33,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:27:33,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:27:33,095 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;@4cf7fdb1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:27:33,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 13:27:33,098 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-12-13 13:27:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 13:27:33,104 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:33,104 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-12-13 13:27:33,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:27:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash -246443823, now seen corresponding path program 1 times [2022-12-13 13:27:33,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:33,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110239749] [2022-12-13 13:27:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 13:27:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:33,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:33,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110239749] [2022-12-13 13:27:33,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110239749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:33,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:33,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:27:33,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366283328] [2022-12-13 13:27:33,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:33,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:27:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:33,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:27:33,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:27:33,369 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-12-13 13:27:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:33,429 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2022-12-13 13:27:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:27:33,431 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-12-13 13:27:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:33,437 INFO L225 Difference]: With dead ends: 62 [2022-12-13 13:27:33,437 INFO L226 Difference]: Without dead ends: 28 [2022-12-13 13:27:33,439 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-12-13 13:27:33,441 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:33,442 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.0s Time] [2022-12-13 13:27:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-13 13:27:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-13 13:27:33,471 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-12-13 13:27:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-12-13 13:27:33,473 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2022-12-13 13:27:33,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:33,473 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-12-13 13:27:33,473 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-12-13 13:27:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-12-13 13:27:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 13:27:33,475 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:33,475 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-12-13 13:27:33,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:27:33,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:27:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1738034235, now seen corresponding path program 1 times [2022-12-13 13:27:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:33,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526788823] [2022-12-13 13:27:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:33,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 13:27:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:33,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:33,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526788823] [2022-12-13 13:27:33,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526788823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:33,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:33,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:27:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001658189] [2022-12-13 13:27:33,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:33,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:27:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:33,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:27:33,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:27:33,632 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-12-13 13:27:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:33,680 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-12-13 13:27:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:27:33,681 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-12-13 13:27:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:33,682 INFO L225 Difference]: With dead ends: 54 [2022-12-13 13:27:33,682 INFO L226 Difference]: Without dead ends: 32 [2022-12-13 13:27:33,682 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-12-13 13:27:33,683 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:33,684 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.0s Time] [2022-12-13 13:27:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-13 13:27:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-12-13 13:27:33,690 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-12-13 13:27:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-12-13 13:27:33,691 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2022-12-13 13:27:33,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:33,691 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 13:27:33,691 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-12-13 13:27:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-12-13 13:27:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 13:27:33,692 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:33,692 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-12-13 13:27:33,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:27:33,693 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:27:33,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1368908325, now seen corresponding path program 1 times [2022-12-13 13:27:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:33,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091059429] [2022-12-13 13:27:33,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:33,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:33,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:27:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 13:27:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:27:33,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:33,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091059429] [2022-12-13 13:27:33,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091059429] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:33,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173951327] [2022-12-13 13:27:33,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:33,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:33,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:33,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:33,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:27:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:33,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:27:33,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:34,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:27:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:27:34,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173951327] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:27:34,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:27:34,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-12-13 13:27:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860928492] [2022-12-13 13:27:34,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:27:34,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:27:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:34,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:27:34,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:27:34,047 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-12-13 13:27:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:34,094 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2022-12-13 13:27:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:27:34,095 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-12-13 13:27:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:34,096 INFO L225 Difference]: With dead ends: 55 [2022-12-13 13:27:34,096 INFO L226 Difference]: Without dead ends: 33 [2022-12-13 13:27:34,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:27:34,097 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:34,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 111 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:27:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-12-13 13:27:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-12-13 13:27:34,100 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-12-13 13:27:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-12-13 13:27:34,101 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 28 [2022-12-13 13:27:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:34,101 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-12-13 13:27:34,101 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-12-13 13:27:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-12-13 13:27:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 13:27:34,102 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:34,103 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-12-13 13:27:34,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:27:34,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:34,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:27:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:34,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1136271419, now seen corresponding path program 2 times [2022-12-13 13:27:34,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:34,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118294965] [2022-12-13 13:27:34,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:27:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:34,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:27:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:34,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 13:27:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 13:27:34,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:34,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118294965] [2022-12-13 13:27:34,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118294965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:34,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:34,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:27:34,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180218505] [2022-12-13 13:27:34,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:34,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:27:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:27:34,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:27:34,444 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-12-13 13:27:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:34,479 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-12-13 13:27:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:27:34,480 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-12-13 13:27:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:34,481 INFO L225 Difference]: With dead ends: 57 [2022-12-13 13:27:34,481 INFO L226 Difference]: Without dead ends: 46 [2022-12-13 13:27:34,481 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-12-13 13:27:34,483 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-12-13 13:27:34,483 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-12-13 13:27:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-12-13 13:27:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-12-13 13:27:34,486 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-12-13 13:27:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-12-13 13:27:34,487 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 37 [2022-12-13 13:27:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:34,487 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-12-13 13:27:34,487 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-12-13 13:27:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-12-13 13:27:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 13:27:34,488 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:34,488 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-12-13 13:27:34,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:27:34,488 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:27:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1079013117, now seen corresponding path program 1 times [2022-12-13 13:27:34,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:34,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052982437] [2022-12-13 13:27:34,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:34,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:34,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:27:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:27:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 13:27:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 13:27:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:34,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052982437] [2022-12-13 13:27:34,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052982437] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:34,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913325658] [2022-12-13 13:27:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:34,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:34,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:34,669 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:34,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:27:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:34,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:27:34,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 13:27:34,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:27:34,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913325658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:34,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:27:34,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-12-13 13:27:34,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653020645] [2022-12-13 13:27:34,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:34,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:27:34,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:34,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:27:34,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:27:34,841 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-12-13 13:27:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:34,858 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-12-13 13:27:34,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:27:34,858 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-12-13 13:27:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:34,859 INFO L225 Difference]: With dead ends: 46 [2022-12-13 13:27:34,859 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 13:27:34,859 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-12-13 13:27:34,860 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-12-13 13:27:34,860 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-12-13 13:27:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 13:27:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-13 13:27:34,865 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-12-13 13:27:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-12-13 13:27:34,866 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 37 [2022-12-13 13:27:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:34,866 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-12-13 13:27:34,867 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-12-13 13:27:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-12-13 13:27:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 13:27:34,868 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:34,868 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-12-13 13:27:34,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:27:35,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:35,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:27:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash -300753136, now seen corresponding path program 1 times [2022-12-13 13:27:35,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:35,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982095715] [2022-12-13 13:27:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:27:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:27:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 13:27:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:27:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:36,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982095715] [2022-12-13 13:27:36,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982095715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:36,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496767273] [2022-12-13 13:27:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:36,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:36,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:36,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:36,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:27:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:36,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 111 conjunts are in the unsatisfiable core [2022-12-13 13:27:36,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:36,869 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-12-13 13:27:36,916 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-12-13 13:27:37,008 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-12-13 13:27:37,243 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-12-13 13:27:37,248 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-12-13 13:27:37,252 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-12-13 13:27:37,257 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-12-13 13:27:37,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:37,463 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-12-13 13:27:37,475 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 13:27:37,476 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-12-13 13:27:37,484 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-12-13 13:27:37,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:37,491 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-12-13 13:27:37,800 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:27:37,801 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-12-13 13:27:37,810 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-12-13 13:27:37,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:37,815 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-12-13 13:27:37,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:37,910 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-12-13 13:27:37,920 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-12-13 13:27:37,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:37,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:37,928 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-12-13 13:27:37,996 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-12-13 13:27:37,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:38,000 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-12-13 13:27:38,041 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-12-13 13:27:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:27:38,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:27:38,089 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-12-13 13:27:38,103 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-12-13 13:27:39,211 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-12-13 13:27:39,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496767273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:39,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:27:39,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2022-12-13 13:27:39,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350917905] [2022-12-13 13:27:39,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:27:39,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 13:27:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 13:27:39,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1100, Unknown=63, NotChecked=210, Total=1482 [2022-12-13 13:27:39,217 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-12-13 13:27:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:40,411 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2022-12-13 13:27:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:27:40,411 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-12-13 13:27:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:40,412 INFO L225 Difference]: With dead ends: 55 [2022-12-13 13:27:40,412 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 13:27:40,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=232, Invalid=2056, Unknown=76, NotChecked=288, Total=2652 [2022-12-13 13:27:40,413 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 166 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:40,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 219 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:27:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 13:27:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-12-13 13:27:40,418 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-12-13 13:27:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-12-13 13:27:40,419 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 38 [2022-12-13 13:27:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:40,419 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-12-13 13:27:40,419 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-12-13 13:27:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2022-12-13 13:27:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 13:27:40,420 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:40,420 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-12-13 13:27:40,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:27:40,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:40,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:27:40,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash -243494834, now seen corresponding path program 1 times [2022-12-13 13:27:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:40,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891600251] [2022-12-13 13:27:40,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:40,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:27:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:27:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 13:27:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:27:40,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:40,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891600251] [2022-12-13 13:27:40,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891600251] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:40,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510299830] [2022-12-13 13:27:40,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:40,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:40,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:40,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:27:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:41,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 13:27:41,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:41,289 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-12-13 13:27:41,321 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-12-13 13:27:41,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:41,336 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-12-13 13:27:41,365 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-12-13 13:27:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-12-13 13:27:41,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:27:41,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510299830] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:41,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:27:41,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-12-13 13:27:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294247707] [2022-12-13 13:27:41,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:27:41,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 13:27:41,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:41,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 13:27:41,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=4, NotChecked=48, Total=702 [2022-12-13 13:27:41,505 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-12-13 13:27:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:41,967 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2022-12-13 13:27:41,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:27:41,967 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-12-13 13:27:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:41,968 INFO L225 Difference]: With dead ends: 60 [2022-12-13 13:27:41,968 INFO L226 Difference]: Without dead ends: 49 [2022-12-13 13:27:41,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=4, NotChecked=64, Total=1190 [2022-12-13 13:27:41,968 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 212 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:41,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 303 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 282 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-12-13 13:27:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-12-13 13:27:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-12-13 13:27:41,979 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-12-13 13:27:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-12-13 13:27:41,979 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 38 [2022-12-13 13:27:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:41,980 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-12-13 13:27:41,980 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-12-13 13:27:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-12-13 13:27:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 13:27:41,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:41,980 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-12-13 13:27:41,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 13:27:42,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-13 13:27:42,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:27:42,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash -733467546, now seen corresponding path program 1 times [2022-12-13 13:27:42,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:42,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135959961] [2022-12-13 13:27:42,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:42,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:42,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:27:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:42,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:27:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:42,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 13:27:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:27:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:42,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135959961] [2022-12-13 13:27:42,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135959961] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:42,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746145020] [2022-12-13 13:27:42,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:42,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:42,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:42,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:42,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:27:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:42,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 13:27:42,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:43,053 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-12-13 13:27:43,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:43,153 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-12-13 13:27:43,342 INFO L321 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2022-12-13 13:27:43,342 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-12-13 13:27:43,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:43,807 INFO L321 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2022-12-13 13:27:43,807 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-12-13 13:27:44,630 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-12-13 13:27:50,207 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-12-13 13:27:50,289 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-12-13 13:27:50,494 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 13:27:50,866 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 13:27:59,289 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-12-13 13:27:59,319 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 13:27:59,476 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-12-13 13:27:59,719 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-12-13 13:28:02,358 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-12-13 13:28:02,370 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-12-13 13:28:02,686 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-12-13 13:28:02,821 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-12-13 13:28:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:28:02,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:28:02,873 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-12-13 13:28:07,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746145020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:28:07,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:28:07,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2022-12-13 13:28:07,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789112253] [2022-12-13 13:28:07,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:28:07,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 13:28:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:28:07,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 13:28:07,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1208, Unknown=13, NotChecked=70, Total=1406 [2022-12-13 13:28:07,226 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-12-13 13:28:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:28:10,430 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-12-13 13:28:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 13:28:10,431 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-12-13 13:28:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:28:10,431 INFO L225 Difference]: With dead ends: 61 [2022-12-13 13:28:10,432 INFO L226 Difference]: Without dead ends: 54 [2022-12-13 13:28:10,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=362, Invalid=2281, Unknown=13, NotChecked=100, Total=2756 [2022-12-13 13:28:10,432 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 394 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:28:10,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 272 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:28:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-13 13:28:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2022-12-13 13:28:10,439 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-12-13 13:28:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-12-13 13:28:10,440 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 39 [2022-12-13 13:28:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:28:10,440 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-12-13 13:28:10,440 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-12-13 13:28:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-12-13 13:28:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 13:28:10,441 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:28:10,441 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-12-13 13:28:10,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:28:10,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:28:10,643 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:28:10,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:28:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -169490139, now seen corresponding path program 2 times [2022-12-13 13:28:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:28:10,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633826299] [2022-12-13 13:28:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:28:10,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:28:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:10,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:28:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:10,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:28:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:10,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 13:28:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 13:28:10,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:28:10,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633826299] [2022-12-13 13:28:10,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633826299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:28:10,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017369371] [2022-12-13 13:28:10,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:28:10,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:28:10,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:28:10,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:28:10,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:28:10,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:28:10,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:28:10,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:28:10,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:28:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 13:28:11,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:28:11,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017369371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:28:11,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:28:11,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 13:28:11,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681111118] [2022-12-13 13:28:11,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:28:11,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:28:11,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:28:11,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:28:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:28:11,015 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-12-13 13:28:11,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:28:11,042 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-12-13 13:28:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:28:11,043 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-12-13 13:28:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:28:11,043 INFO L225 Difference]: With dead ends: 50 [2022-12-13 13:28:11,044 INFO L226 Difference]: Without dead ends: 36 [2022-12-13 13:28:11,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:28:11,044 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 53 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-12-13 13:28:11,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 53 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:28:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-12-13 13:28:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-12-13 13:28:11,054 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-12-13 13:28:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-12-13 13:28:11,055 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 39 [2022-12-13 13:28:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:28:11,055 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-12-13 13:28:11,055 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-12-13 13:28:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-12-13 13:28:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 13:28:11,056 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:28:11,056 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-12-13 13:28:11,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 13:28:11,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:28:11,257 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:28:11,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:28:11,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1260942485, now seen corresponding path program 1 times [2022-12-13 13:28:11,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:28:11,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063874134] [2022-12-13 13:28:11,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:28:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:28:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:11,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:28:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:11,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:28:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:11,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 13:28:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 13:28:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:28:11,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063874134] [2022-12-13 13:28:11,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063874134] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:28:11,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518579245] [2022-12-13 13:28:11,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:28:11,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:28:11,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:28:11,486 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:28:11,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:28:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:11,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 13:28:11,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:28:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 13:28:11,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:28:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 13:28:11,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518579245] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:28:11,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:28:11,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-12-13 13:28:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752238079] [2022-12-13 13:28:11,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:28:11,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:28:11,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:28:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:28:11,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:28:11,741 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-12-13 13:28:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:28:11,889 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-12-13 13:28:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:28:11,889 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-12-13 13:28:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:28:11,889 INFO L225 Difference]: With dead ends: 46 [2022-12-13 13:28:11,890 INFO L226 Difference]: Without dead ends: 37 [2022-12-13 13:28:11,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-12-13 13:28:11,890 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 75 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:28:11,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 145 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:28:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-13 13:28:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-12-13 13:28:11,898 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-12-13 13:28:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-12-13 13:28:11,898 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 40 [2022-12-13 13:28:11,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:28:11,899 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-12-13 13:28:11,899 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-12-13 13:28:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-12-13 13:28:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 13:28:11,900 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:28:11,900 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-12-13 13:28:11,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 13:28:12,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 13:28:12,102 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:28:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:28:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash -434566293, now seen corresponding path program 1 times [2022-12-13 13:28:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:28:12,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876155429] [2022-12-13 13:28:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:28:12,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:28:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 13:28:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:28:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:13,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 13:28:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:28:13,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:28:13,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876155429] [2022-12-13 13:28:13,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876155429] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:28:13,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015138601] [2022-12-13 13:28:13,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:28:13,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:28:13,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:28:13,241 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:28:13,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfdc08b9-dc73-44b8-8f66-e35428d83310/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:28:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:28:13,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-13 13:28:13,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:28:13,503 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-12-13 13:28:13,734 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-12-13 13:28:13,737 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-12-13 13:28:13,740 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-12-13 13:28:13,801 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-12-13 13:28:13,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:28:13,880 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-12-13 13:28:13,889 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 13:28:13,890 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-12-13 13:28:13,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:28:13,899 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-12-13 13:28:14,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:28:14,132 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-12-13 13:28:14,137 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-12-13 13:28:14,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:28:14,143 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-12-13 13:28:14,233 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 13:28:14,234 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-12-13 13:28:14,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:28:14,249 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-12-13 13:28:14,249 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-12-13 13:28:14,261 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-12-13 13:28:14,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:28:14,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:28:14,409 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-12-13 13:28:14,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:28:14,415 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-12-13 13:28:14,490 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-12-13 13:28:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:28:14,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:28:14,540 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-12-13 13:28:14,559 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-12-13 13:28:14,584 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-12-13 13:28:14,596 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-12-13 13:28:14,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:28:14,682 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-12-13 13:28:14,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:28:14,697 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-12-13 13:28:14,713 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-12-13 13:28:15,128 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-12-13 13:29:08,480 WARN L233 SmtUtils]: Spent 53.33s 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-12-13 13:29:08,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:29:08,482 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