./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 0e0057cc 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_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:36:32,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:36:32,540 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:36:32,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:36:32,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:36:32,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:36:32,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:36:32,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:36:32,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:36:32,574 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:36:32,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:36:32,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:36:32,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:36:32,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:36:32,578 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:36:32,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:36:32,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:36:32,579 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:36:32,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:36:32,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:36:32,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:36:32,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:36:32,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:36:32,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:36:32,583 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:36:32,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:36:32,584 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:36:32,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:36:32,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:36:32,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:36:32,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:36:32,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:36:32,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:36:32,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:36:32,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:36:32,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:36:32,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:36:32,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:36:32,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:36:32,588 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:36:32,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:36:32,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:36:32,589 INFO L153 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_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/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_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-11-29 03:36:32,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:36:32,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:36:32,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:36:32,831 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:36:32,834 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:36:32,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-29 03:36:35,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:36:36,012 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:36:36,013 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-29 03:36:36,028 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/data/2ecadc5b3/d282e111831941e1a03b9e5f6c4ec7c4/FLAG4533ca603 [2023-11-29 03:36:36,042 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/data/2ecadc5b3/d282e111831941e1a03b9e5f6c4ec7c4 [2023-11-29 03:36:36,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:36:36,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:36:36,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:36:36,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:36:36,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:36:36,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad506cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36, skipping insertion in model container [2023-11-29 03:36:36,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,110 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:36:36,402 WARN L240 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_e064331a-c023-4de3-8551-bab71ccef2fa/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2023-11-29 03:36:36,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:36:36,418 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:36:36,462 WARN L240 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_e064331a-c023-4de3-8551-bab71ccef2fa/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2023-11-29 03:36:36,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:36:36,494 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:36:36,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36 WrapperNode [2023-11-29 03:36:36,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:36:36,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:36:36,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:36:36,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:36:36,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,541 INFO L138 Inliner]: procedures = 128, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 151 [2023-11-29 03:36:36,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:36:36,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:36:36,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:36:36,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:36:36,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,588 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2023-11-29 03:36:36,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:36:36,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:36:36,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:36:36,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:36:36,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (1/1) ... [2023-11-29 03:36:36,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:36:36,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:36:36,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:36:36,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:36:36,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:36:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:36:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:36:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:36:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:36:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:36:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 03:36:36,729 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 03:36:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:36:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:36:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:36:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:36:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:36:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:36:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:36:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:36:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:36:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:36:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:36:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:36:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:36:36,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:36:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:36:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:36:36,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:36:36,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:36:36,884 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:36:36,887 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:36:37,092 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:36:37,131 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:36:37,131 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 03:36:37,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:36:37 BoogieIcfgContainer [2023-11-29 03:36:37,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:36:37,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:36:37,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:36:37,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:36:37,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:36:36" (1/3) ... [2023-11-29 03:36:37,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a1c14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:36:37, skipping insertion in model container [2023-11-29 03:36:37,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:36:36" (2/3) ... [2023-11-29 03:36:37,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a1c14a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:36:37, skipping insertion in model container [2023-11-29 03:36:37,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:36:37" (3/3) ... [2023-11-29 03:36:37,140 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2023-11-29 03:36:37,156 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:36:37,156 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:36:37,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:36:37,202 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=LoopHeads, 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;@29b635d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:36:37,202 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:36:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 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) [2023-11-29 03:36:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:36:37,211 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:36:37,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:36:37,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:36:37,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:36:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash -28865109, now seen corresponding path program 1 times [2023-11-29 03:36:37,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:36:37,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585500454] [2023-11-29 03:36:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:37,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:36:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:37,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 03:36:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:36:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:36:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585500454] [2023-11-29 03:36:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585500454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:36:37,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:36:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:36:37,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421892349] [2023-11-29 03:36:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:36:37,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:36:37,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:36:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:36:37,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:36:37,528 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-11-29 03:36:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:36:37,591 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2023-11-29 03:36:37,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:36:37,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14 [2023-11-29 03:36:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:36:37,602 INFO L225 Difference]: With dead ends: 50 [2023-11-29 03:36:37,602 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 03:36:37,605 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 [2023-11-29 03:36:37,609 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:36:37,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:36:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 03:36:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-29 03:36:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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) [2023-11-29 03:36:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-11-29 03:36:37,648 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 14 [2023-11-29 03:36:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:36:37,648 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-11-29 03:36:37,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-11-29 03:36:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-11-29 03:36:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:36:37,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:36:37,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:36:37,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:36:37,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:36:37,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:36:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2091124953, now seen corresponding path program 1 times [2023-11-29 03:36:37,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:36:37,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766322151] [2023-11-29 03:36:37,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:36:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:37,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 03:36:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:36:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:36:37,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766322151] [2023-11-29 03:36:37,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766322151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:36:37,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:36:37,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:36:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103018902] [2023-11-29 03:36:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:36:37,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:36:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:36:37,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:36:37,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:36:37,838 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-11-29 03:36:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:36:37,885 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2023-11-29 03:36:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:36:37,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2023-11-29 03:36:37,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:36:37,887 INFO L225 Difference]: With dead ends: 43 [2023-11-29 03:36:37,887 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 03:36:37,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:36:37,889 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:36:37,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:36:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 03:36:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-29 03:36:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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) [2023-11-29 03:36:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-11-29 03:36:37,899 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2023-11-29 03:36:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:36:37,899 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-11-29 03:36:37,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-11-29 03:36:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-11-29 03:36:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:36:37,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:36:37,901 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:36:37,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:36:37,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:36:37,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:36:37,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2115192704, now seen corresponding path program 1 times [2023-11-29 03:36:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:36:37,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848912328] [2023-11-29 03:36:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:37,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:36:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:38,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:36:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:38,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 03:36:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:36:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:36:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848912328] [2023-11-29 03:36:38,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848912328] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:36:38,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97897473] [2023-11-29 03:36:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:38,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:36:38,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:36:38,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:36:38,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:36:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:38,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:36:38,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:36:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:36:38,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:36:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:36:38,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97897473] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:36:38,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:36:38,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-11-29 03:36:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977050782] [2023-11-29 03:36:38,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:36:38,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:36:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:36:38,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:36:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:36:38,359 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2023-11-29 03:36:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:36:38,416 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2023-11-29 03:36:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:36:38,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2023-11-29 03:36:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:36:38,418 INFO L225 Difference]: With dead ends: 44 [2023-11-29 03:36:38,418 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 03:36:38,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:36:38,420 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:36:38,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 80 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:36:38,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 03:36:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-29 03:36:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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) [2023-11-29 03:36:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-11-29 03:36:38,426 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 20 [2023-11-29 03:36:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:36:38,426 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-11-29 03:36:38,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2023-11-29 03:36:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-11-29 03:36:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:36:38,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:36:38,428 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:36:38,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:36:38,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-29 03:36:38,633 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:36:38,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:36:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1441189607, now seen corresponding path program 2 times [2023-11-29 03:36:38,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:36:38,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091737696] [2023-11-29 03:36:38,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:38,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:36:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:38,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:36:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:36:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:36:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:36:38,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:36:38,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091737696] [2023-11-29 03:36:38,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091737696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:36:38,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:36:38,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:36:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683448041] [2023-11-29 03:36:38,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:36:38,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:36:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:36:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:36:38,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:36:38,786 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-29 03:36:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:36:38,832 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2023-11-29 03:36:38,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:36:38,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 26 [2023-11-29 03:36:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:36:38,834 INFO L225 Difference]: With dead ends: 39 [2023-11-29 03:36:38,834 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 03:36:38,834 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 [2023-11-29 03:36:38,835 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:36:38,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:36:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 03:36:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-11-29 03:36:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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) [2023-11-29 03:36:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-11-29 03:36:38,842 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 26 [2023-11-29 03:36:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:36:38,843 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-11-29 03:36:38,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-11-29 03:36:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-11-29 03:36:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:36:38,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:36:38,844 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:36:38,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:36:38,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:36:38,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:36:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1439342565, now seen corresponding path program 1 times [2023-11-29 03:36:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:36:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149837487] [2023-11-29 03:36:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:36:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:36:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:36:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:36:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 03:36:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:36:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149837487] [2023-11-29 03:36:39,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149837487] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:36:39,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105761422] [2023-11-29 03:36:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:39,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:36:39,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:36:39,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:36:39,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:36:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:39,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:36:39,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:36:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:36:39,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:36:39,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105761422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:36:39,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:36:39,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-11-29 03:36:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279479131] [2023-11-29 03:36:39,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:36:39,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:36:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:36:39,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:36:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:36:39,401 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-11-29 03:36:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:36:39,436 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2023-11-29 03:36:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:36:39,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 26 [2023-11-29 03:36:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:36:39,438 INFO L225 Difference]: With dead ends: 38 [2023-11-29 03:36:39,438 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 03:36:39,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:36:39,440 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:36:39,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:36:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 03:36:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 03:36:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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) [2023-11-29 03:36:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-11-29 03:36:39,446 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 26 [2023-11-29 03:36:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:36:39,447 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-29 03:36:39,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-11-29 03:36:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-11-29 03:36:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:36:39,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:36:39,448 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:36:39,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 03:36:39,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:36:39,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:36:39,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:36:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash -262117536, now seen corresponding path program 1 times [2023-11-29 03:36:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:36:39,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252036453] [2023-11-29 03:36:39,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:36:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:40,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:36:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:40,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:36:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:41,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:36:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:36:41,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:36:41,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252036453] [2023-11-29 03:36:41,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252036453] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:36:41,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999401099] [2023-11-29 03:36:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:41,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:36:41,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:36:41,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:36:41,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 03:36:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:41,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-29 03:36:41,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:36:41,560 INFO L378 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 [2023-11-29 03:36:41,575 INFO L378 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 [2023-11-29 03:36:41,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:36:41,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:36:41,807 INFO L378 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 [2023-11-29 03:36:41,995 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:36:41,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 03:36:42,030 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 03:36:42,031 INFO L378 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 [2023-11-29 03:36:42,318 INFO L378 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 27 treesize of output 15 [2023-11-29 03:36:42,402 INFO L378 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 20 treesize of output 15 [2023-11-29 03:36:42,409 INFO L378 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 [2023-11-29 03:36:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:36:42,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:36:42,513 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_616 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_616) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-11-29 03:36:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999401099] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:36:43,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:36:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2023-11-29 03:36:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364328040] [2023-11-29 03:36:43,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:36:43,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 03:36:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:36:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 03:36:43,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=999, Unknown=36, NotChecked=64, Total=1190 [2023-11-29 03:36:43,006 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 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) [2023-11-29 03:36:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:36:43,830 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2023-11-29 03:36:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 03:36:43,831 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 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 27 [2023-11-29 03:36:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:36:43,831 INFO L225 Difference]: With dead ends: 41 [2023-11-29 03:36:43,832 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 03:36:43,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=151, Invalid=1709, Unknown=36, NotChecked=84, Total=1980 [2023-11-29 03:36:43,834 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:36:43,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 247 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:36:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 03:36:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-11-29 03:36:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:36:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-29 03:36:43,842 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 27 [2023-11-29 03:36:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:36:43,843 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-29 03:36:43,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 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) [2023-11-29 03:36:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-29 03:36:43,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:36:43,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:36:43,845 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:36:43,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 03:36:44,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:36:44,045 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:36:44,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:36:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -260270494, now seen corresponding path program 1 times [2023-11-29 03:36:44,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:36:44,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539306770] [2023-11-29 03:36:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:36:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:44,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:36:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:44,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:36:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:36:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:36:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:36:44,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539306770] [2023-11-29 03:36:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539306770] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:36:44,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264964082] [2023-11-29 03:36:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:36:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:36:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:36:44,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:36:44,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 03:36:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:36:44,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:36:44,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:36:44,663 INFO L378 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 [2023-11-29 03:36:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:36:44,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:36:44,738 INFO L378 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 [2023-11-29 03:36:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:36:44,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264964082] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:36:44,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:36:44,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-11-29 03:36:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365679256] [2023-11-29 03:36:44,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:36:44,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 03:36:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:36:44,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 03:36:44,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:36:44,767 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 03:36:48,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:52,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:36:56,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:00,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:04,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:09,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:13,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:37:13,019 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2023-11-29 03:37:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:37:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 27 [2023-11-29 03:37:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:37:13,021 INFO L225 Difference]: With dead ends: 55 [2023-11-29 03:37:13,021 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 03:37:13,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2023-11-29 03:37:13,022 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 82 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:37:13,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 249 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2023-11-29 03:37:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 03:37:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2023-11-29 03:37:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:37:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-11-29 03:37:13,028 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 27 [2023-11-29 03:37:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:37:13,028 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-11-29 03:37:13,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 03:37:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-11-29 03:37:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:37:13,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:37:13,029 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:13,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 03:37:13,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:37:13,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:37:13,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash 464236054, now seen corresponding path program 1 times [2023-11-29 03:37:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:37:13,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265555710] [2023-11-29 03:37:13,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:37:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:37:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:13,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:37:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:13,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:37:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:37:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:37:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265555710] [2023-11-29 03:37:13,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265555710] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:37:13,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366116348] [2023-11-29 03:37:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:13,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:37:13,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:37:13,615 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:37:13,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 03:37:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:13,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 03:37:13,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:13,908 INFO L378 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 [2023-11-29 03:37:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:37:13,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:37:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:37:14,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366116348] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:37:14,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:37:14,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2023-11-29 03:37:14,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166190752] [2023-11-29 03:37:14,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:37:14,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:37:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:37:14,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:37:14,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:37:14,035 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:37:18,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:22,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:26,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:30,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:34,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:38,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:42,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:37:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:37:42,294 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2023-11-29 03:37:42,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:37:42,295 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-29 03:37:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:37:42,295 INFO L225 Difference]: With dead ends: 56 [2023-11-29 03:37:42,295 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 03:37:42,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-11-29 03:37:42,296 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 77 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:37:42,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 256 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2023-11-29 03:37:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 03:37:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2023-11-29 03:37:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:37:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-11-29 03:37:42,302 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2023-11-29 03:37:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:37:42,303 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-11-29 03:37:42,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:37:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-11-29 03:37:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:37:42,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:37:42,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:42,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 03:37:42,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:37:42,504 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:37:42,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1929378297, now seen corresponding path program 2 times [2023-11-29 03:37:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:37:42,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975211294] [2023-11-29 03:37:42,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:37:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:42,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:37:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:42,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:37:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:42,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:37:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 03:37:42,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:37:42,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975211294] [2023-11-29 03:37:42,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975211294] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:37:42,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856022017] [2023-11-29 03:37:42,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:37:42,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:37:42,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:37:42,716 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:37:42,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 03:37:42,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:37:42,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:37:42,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:37:42,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:37:42,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:37:42,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856022017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:37:42,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:37:42,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-11-29 03:37:42,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957776541] [2023-11-29 03:37:42,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:37:42,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:37:42,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:37:42,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:37:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:37:42,942 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-11-29 03:37:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:37:42,987 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2023-11-29 03:37:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:37:42,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 28 [2023-11-29 03:37:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:37:42,988 INFO L225 Difference]: With dead ends: 46 [2023-11-29 03:37:42,988 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 03:37:42,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:37:42,989 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:37:42,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 61 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:37:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 03:37:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 03:37:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:37:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-11-29 03:37:42,997 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 28 [2023-11-29 03:37:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:37:42,997 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-11-29 03:37:42,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2023-11-29 03:37:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-11-29 03:37:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 03:37:42,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:37:42,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:43,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-29 03:37:43,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:37:43,199 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:37:43,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1508130747, now seen corresponding path program 1 times [2023-11-29 03:37:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:37:43,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414156705] [2023-11-29 03:37:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:37:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:37:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:43,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:37:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:37:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 03:37:43,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:37:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414156705] [2023-11-29 03:37:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414156705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:37:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504615883] [2023-11-29 03:37:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:43,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:37:43,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:37:43,517 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:37:43,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 03:37:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:43,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:37:43,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:37:43,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:37:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:37:43,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504615883] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:37:43,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:37:43,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2023-11-29 03:37:43,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440855173] [2023-11-29 03:37:43,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:37:43,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:37:43,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:37:43,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:37:43,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:37:43,838 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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) [2023-11-29 03:37:43,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:37:43,995 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-29 03:37:43,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 03:37:43,996 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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 29 [2023-11-29 03:37:43,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:37:43,996 INFO L225 Difference]: With dead ends: 42 [2023-11-29 03:37:43,997 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 03:37:43,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-11-29 03:37:43,998 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 66 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:37:43,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 102 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:37:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 03:37:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-29 03:37:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:37:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-29 03:37:44,006 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2023-11-29 03:37:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:37:44,006 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-29 03:37:44,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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) [2023-11-29 03:37:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-29 03:37:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:37:44,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:37:44,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:37:44,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 03:37:44,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 03:37:44,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:37:44,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:37:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash -492642021, now seen corresponding path program 1 times [2023-11-29 03:37:44,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:37:44,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781956877] [2023-11-29 03:37:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:44,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:37:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:45,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:37:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:45,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:37:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:45,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 03:37:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 03:37:45,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:37:45,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781956877] [2023-11-29 03:37:45,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781956877] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:37:45,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152061092] [2023-11-29 03:37:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:37:45,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:37:45,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:37:45,268 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:37:45,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 03:37:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:37:45,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 03:37:45,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:37:45,701 INFO L378 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 [2023-11-29 03:37:45,747 INFO L378 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 [2023-11-29 03:37:45,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:37:45,866 INFO L378 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 [2023-11-29 03:37:45,970 INFO L378 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 [2023-11-29 03:37:46,045 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 03:37:46,045 INFO L378 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 [2023-11-29 03:37:46,067 INFO L378 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 20 treesize of output 15 [2023-11-29 03:37:46,341 INFO L378 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 31 treesize of output 15 [2023-11-29 03:37:46,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:37:46,361 INFO L378 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 11 [2023-11-29 03:37:46,453 INFO L378 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 137 treesize of output 89 [2023-11-29 03:37:46,466 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:37:46,466 INFO L378 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 79 treesize of output 68 [2023-11-29 03:37:46,472 INFO L378 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 39 treesize of output 15 [2023-11-29 03:37:46,477 INFO L378 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 11 [2023-11-29 03:37:46,527 INFO L378 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 27 treesize of output 15 [2023-11-29 03:37:46,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:37:46,600 INFO L378 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 [2023-11-29 03:37:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 03:37:46,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:37:46,622 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1431 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1431) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse0) .cse1)))) (not (= v_ArrVal_1430 (let ((.cse2 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1430 .cse2))))))) is different from false [2023-11-29 03:37:46,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:37:46,634 INFO L378 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 67 treesize of output 68 [2023-11-29 03:37:46,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:37:46,646 INFO L378 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 130 treesize of output 129 [2023-11-29 03:37:46,656 INFO L378 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 56 treesize of output 48 [2023-11-29 03:37:46,846 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse5 (+ .cse7 4)) (.cse0 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse4))) (let ((.cse6 (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1427))) (or (not (= (store (select .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1430 .cse2)) v_ArrVal_1430)) (forall ((v_ArrVal_1432 (Array Int Int))) (let ((.cse11 (store .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430)) (.cse12 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5))) (or (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_29) .cse12))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_27) .cse12)))))))) (or (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1427))) (or (not (= (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1430 .cse2)) v_ArrVal_1430)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430) v_arrayElimCell_27) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5)))))) .cse0)))) (and (or (not .cse0) (forall ((v_ArrVal_1427 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1427))) (or (not (= (store (select .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1430 .cse2)) v_ArrVal_1430)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse1 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430) v_arrayElimCell_29) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5))))))) (or .cse6 (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| .cse7)) (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1427))) (or (not (= (store (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1430 .cse2)) v_ArrVal_1430)) (forall ((v_ArrVal_1432 (Array Int Int))) (let ((.cse9 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5))) (or (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430) v_arrayElimCell_29) .cse9))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1430 .cse9)))))))) (or (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_1) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5)))) .cse0) (or (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse4) .cse6))))) is different from false [2023-11-29 03:37:47,139 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse4)) (.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse5 (+ .cse1 4)) (.cse2 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse0 (and (or (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1427))) (or (not (= v_ArrVal_1430 (store (select .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1430 .cse2)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430) v_arrayElimCell_27) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5)))))) .cse6) (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1427))) (or (forall ((v_ArrVal_1432 (Array Int Int))) (let ((.cse11 (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430)) (.cse12 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5))) (or (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_29) .cse12))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_27) .cse12))))) (not (= v_ArrVal_1430 (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1430 .cse2)))))))))) (and (or .cse0 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| .cse1)) (or (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_1) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5)))) .cse6) (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1427))) (or (forall ((v_ArrVal_1432 (Array Int Int))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1430 .cse7)) (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430) v_arrayElimCell_29) .cse7)))))) (not (= v_ArrVal_1430 (store (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1430 .cse2))))))) (or .cse0 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse4)) (or (forall ((v_ArrVal_1427 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1427))) (or (not (= v_ArrVal_1430 (store (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1430 .cse2)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1430) v_arrayElimCell_29) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1432) .cse4) .cse5)))))) (not .cse6)))))) is different from false [2023-11-29 03:37:47,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse2)) (.cse4 (store |c_#memory_$Pointer$#1.offset| .cse1 (store (select |c_#memory_$Pointer$#1.offset| .cse1) (+ 4 .cse9) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) (.cse5 (+ .cse8 4)) (.cse6 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) (let ((.cse0 (and (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse14 (store |c_#memory_int#1| .cse1 v_ArrVal_1427))) (or (forall ((v_ArrVal_1432 (Array Int Int))) (let ((.cse12 (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1430)) (.cse13 (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1432) .cse2) .cse5))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_27) .cse13)) (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse12 v_arrayElimCell_29) .cse13)))))) (not (= (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 (select v_ArrVal_1430 .cse6)) v_ArrVal_1430))))) (or .cse7 (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1430 (Array Int Int)) (v_arrayElimCell_27 Int)) (let ((.cse15 (store |c_#memory_int#1| .cse1 v_ArrVal_1427))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1430) v_arrayElimCell_27) (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1432) .cse2) .cse5))) (not (= (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 (select v_ArrVal_1430 .cse6)) v_ArrVal_1430))))))))) (and (or .cse0 (= .cse1 .cse2)) (or (forall ((v_ArrVal_1427 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1432 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (let ((.cse3 (store |c_#memory_int#1| .cse1 v_ArrVal_1427))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1430) v_arrayElimCell_29) (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1432) .cse2) .cse5))) (not (= (store (select .cse3 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 (select v_ArrVal_1430 .cse6)) v_ArrVal_1430))))) (not .cse7)) (or .cse7 (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1432 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= (select (store (select (store |c_#memory_int#1| .cse1 v_ArrVal_1427) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 v_DerPreprocessor_1) (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1432) .cse2) .cse5)) |c_ULTIMATE.start_main_~uneq~0#1|))) (or .cse0 (= .cse8 .cse9)) (forall ((v_ArrVal_1427 (Array Int Int)) (v_ArrVal_1430 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| .cse1 v_ArrVal_1427))) (or (forall ((v_ArrVal_1432 (Array Int Int))) (let ((.cse11 (select (select (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1432) .cse2) .cse5))) (or (forall ((v_arrayElimCell_29 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1430) v_arrayElimCell_29) .cse11))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select v_ArrVal_1430 .cse11))))) (not (= (store (select .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse6 (select v_ArrVal_1430 .cse6)) v_ArrVal_1430))))))))) is different from false [2023-11-29 03:37:49,915 INFO L349 Elim1Store]: treesize reduction 792, result has 80.7 percent of original size [2023-11-29 03:37:49,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 37 case distinctions, treesize of input 3419 treesize of output 6076 [2023-11-29 03:37:50,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:37:50,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 2654 treesize of output 2910 [2023-11-29 03:37:50,733 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2023-11-29 03:37:50,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1815 treesize of output 1826 [2023-11-29 03:37:50,965 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2023-11-29 03:37:50,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1722 treesize of output 1777 [2023-11-29 03:37:51,152 INFO L378 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 1767 treesize of output 1723 [2023-11-29 03:37:51,390 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2023-11-29 03:37:51,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1723 treesize of output 1778 [2023-11-29 03:37:51,613 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2023-11-29 03:37:51,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1674 treesize of output 1729 [2023-11-29 03:37:51,856 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2023-11-29 03:37:51,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1625 treesize of output 1636 [2023-11-29 03:37:52,220 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2023-11-29 03:37:52,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1532 treesize of output 1587 [2023-11-29 03:38:09,998 INFO L378 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 48 treesize of output 4 [2023-11-29 03:45:52,509 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 03:45:52,509 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 03:45:52,510 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 03:45:52,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 03:45:52,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 03:45:52,711 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 60 more [2023-11-29 03:45:52,714 INFO L158 Benchmark]: Toolchain (without parser) took 556667.78ms. Allocated memory was 155.2MB in the beginning and 597.7MB in the end (delta: 442.5MB). Free memory was 117.0MB in the beginning and 313.5MB in the end (delta: -196.5MB). Peak memory consumption was 368.6MB. Max. memory is 16.1GB. [2023-11-29 03:45:52,714 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:45:52,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.40ms. Allocated memory is still 155.2MB. Free memory was 116.4MB in the beginning and 98.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:45:52,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.74ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:45:52,715 INFO L158 Benchmark]: Boogie Preprocessor took 93.82ms. Allocated memory is still 155.2MB. Free memory was 96.0MB in the beginning and 93.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:45:52,716 INFO L158 Benchmark]: RCFGBuilder took 494.66ms. Allocated memory is still 155.2MB. Free memory was 93.0MB in the beginning and 72.4MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 03:45:52,716 INFO L158 Benchmark]: TraceAbstraction took 555579.15ms. Allocated memory was 155.2MB in the beginning and 597.7MB in the end (delta: 442.5MB). Free memory was 72.1MB in the beginning and 313.5MB in the end (delta: -241.4MB). Peak memory consumption was 324.5MB. Max. memory is 16.1GB. [2023-11-29 03:45:52,718 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 111.1MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.40ms. Allocated memory is still 155.2MB. Free memory was 116.4MB in the beginning and 98.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.74ms. Allocated memory is still 155.2MB. Free memory was 98.1MB in the beginning and 96.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.82ms. Allocated memory is still 155.2MB. Free memory was 96.0MB in the beginning and 93.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 494.66ms. Allocated memory is still 155.2MB. Free memory was 93.0MB in the beginning and 72.4MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 555579.15ms. Allocated memory was 155.2MB in the beginning and 597.7MB in the end (delta: 442.5MB). Free memory was 72.1MB in the beginning and 313.5MB in the end (delta: -241.4MB). Peak memory consumption was 324.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:45:54,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:45:54,893 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 03:45:54,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:45:54,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:45:54,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:45:54,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:45:54,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:45:54,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:45:54,938 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:45:54,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:45:54,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:45:54,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:45:54,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:45:54,942 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:45:54,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:45:54,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:45:54,945 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:45:54,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:45:54,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:45:54,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:45:54,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:45:54,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:45:54,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:45:54,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:45:54,951 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:45:54,951 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:45:54,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:45:54,953 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:45:54,953 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:45:54,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:45:54,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:45:54,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:45:54,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:45:54,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:45:54,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:45:54,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:45:54,956 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:45:54,957 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:45:54,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:45:54,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:45:54,957 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:45:54,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:45:54,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:45:54,958 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:45:54,971 INFO L153 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_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/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_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 [2023-11-29 03:45:55,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:45:55,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:45:55,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:45:55,385 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:45:55,385 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:45:55,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-29 03:45:58,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:45:59,009 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:45:59,010 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-29 03:45:59,024 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/data/01e265993/022ac2234f2e4526a4ae675347afd5bf/FLAG2cd24fe8f [2023-11-29 03:45:59,037 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/data/01e265993/022ac2234f2e4526a4ae675347afd5bf [2023-11-29 03:45:59,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:45:59,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:45:59,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:45:59,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:45:59,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:45:59,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ec84f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59, skipping insertion in model container [2023-11-29 03:45:59,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,089 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:45:59,342 WARN L240 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_e064331a-c023-4de3-8551-bab71ccef2fa/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2023-11-29 03:45:59,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:45:59,358 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:45:59,397 WARN L240 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_e064331a-c023-4de3-8551-bab71ccef2fa/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i[24620,24633] [2023-11-29 03:45:59,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:45:59,438 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:45:59,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59 WrapperNode [2023-11-29 03:45:59,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:45:59,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:45:59,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:45:59,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:45:59,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,489 INFO L138 Inliner]: procedures = 131, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2023-11-29 03:45:59,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:45:59,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:45:59,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:45:59,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:45:59,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,504 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,522 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 13, 5]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2023-11-29 03:45:59,523 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:45:59,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:45:59,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:45:59,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:45:59,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (1/1) ... [2023-11-29 03:45:59,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:45:59,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:45:59,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:45:59,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:45:59,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:45:59,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:45:59,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 03:45:59,619 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 03:45:59,619 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 03:45:59,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:45:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:45:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:45:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:45:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:45:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:45:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:45:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:45:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:45:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:45:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:45:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:45:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 03:45:59,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 03:45:59,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 03:45:59,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 03:45:59,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:45:59,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:45:59,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:45:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:45:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:45:59,768 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:45:59,770 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:46:00,059 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:46:00,098 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:46:00,098 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 03:46:00,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:46:00 BoogieIcfgContainer [2023-11-29 03:46:00,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:46:00,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:46:00,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:46:00,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:46:00,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:45:59" (1/3) ... [2023-11-29 03:46:00,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc2368c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:46:00, skipping insertion in model container [2023-11-29 03:46:00,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:45:59" (2/3) ... [2023-11-29 03:46:00,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc2368c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:46:00, skipping insertion in model container [2023-11-29 03:46:00,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:46:00" (3/3) ... [2023-11-29 03:46:00,108 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2023-11-29 03:46:00,126 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:46:00,127 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:46:00,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:46:00,181 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=LoopHeads, 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;@14fb35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:46:00,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:46:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 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) [2023-11-29 03:46:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:46:00,193 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:00,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:00,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:00,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash -28865109, now seen corresponding path program 1 times [2023-11-29 03:46:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924619487] [2023-11-29 03:46:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:00,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:00,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:00,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:00,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 03:46:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:00,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:46:00,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:00,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:46:00,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:46:00,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924619487] [2023-11-29 03:46:00,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924619487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:00,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:00,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:46:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518357249] [2023-11-29 03:46:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:00,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:46:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:46:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:46:00,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:46:00,475 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-11-29 03:46:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:00,557 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2023-11-29 03:46:00,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:46:00,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14 [2023-11-29 03:46:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:00,568 INFO L225 Difference]: With dead ends: 50 [2023-11-29 03:46:00,568 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 03:46:00,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:46:00,574 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:00,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:46:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 03:46:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-29 03:46:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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) [2023-11-29 03:46:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2023-11-29 03:46:00,609 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 14 [2023-11-29 03:46:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:00,610 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-11-29 03:46:00,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-11-29 03:46:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2023-11-29 03:46:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:46:00,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:00,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:00,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:46:00,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:00,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:00,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2091124953, now seen corresponding path program 1 times [2023-11-29 03:46:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711569946] [2023-11-29 03:46:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:00,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:00,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:00,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:00,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 03:46:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:00,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:46:00,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:00,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:46:01,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:46:01,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711569946] [2023-11-29 03:46:01,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711569946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:01,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:01,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:46:01,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428402770] [2023-11-29 03:46:01,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:01,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:46:01,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:46:01,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:46:01,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:46:01,004 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-11-29 03:46:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:01,100 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2023-11-29 03:46:01,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:46:01,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14 [2023-11-29 03:46:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:01,103 INFO L225 Difference]: With dead ends: 43 [2023-11-29 03:46:01,103 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 03:46:01,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:46:01,105 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:01,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:46:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 03:46:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-11-29 03:46:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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) [2023-11-29 03:46:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-11-29 03:46:01,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2023-11-29 03:46:01,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:01,114 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-11-29 03:46:01,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2023-11-29 03:46:01,114 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-11-29 03:46:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:46:01,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:01,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:01,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 03:46:01,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:01,318 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:01,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2115192704, now seen corresponding path program 1 times [2023-11-29 03:46:01,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497515157] [2023-11-29 03:46:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:01,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:01,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:01,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:01,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 03:46:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:01,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:46:01,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:46:01,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:46:01,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:46:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497515157] [2023-11-29 03:46:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497515157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:46:01,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:46:01,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-29 03:46:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058713208] [2023-11-29 03:46:01,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:01,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:46:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:46:01,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:46:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:46:01,593 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:46:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:01,795 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2023-11-29 03:46:01,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:46:01,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2023-11-29 03:46:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:01,797 INFO L225 Difference]: With dead ends: 46 [2023-11-29 03:46:01,797 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 03:46:01,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:46:01,799 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:01,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 95 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:46:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 03:46:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-11-29 03:46:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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) [2023-11-29 03:46:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-11-29 03:46:01,806 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 20 [2023-11-29 03:46:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:01,806 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-11-29 03:46:01,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 03:46:01,807 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-11-29 03:46:01,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:46:01,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:01,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:01,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 03:46:02,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:02,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:02,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:02,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1441189607, now seen corresponding path program 2 times [2023-11-29 03:46:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:02,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425125704] [2023-11-29 03:46:02,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:46:02,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:02,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:02,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:02,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 03:46:02,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 03:46:02,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:46:02,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:46:02,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:46:02,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:46:02,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:46:02,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425125704] [2023-11-29 03:46:02,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425125704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:46:02,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:46:02,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:46:02,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711931604] [2023-11-29 03:46:02,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:46:02,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:46:02,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:46:02,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:46:02,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:46:02,237 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-11-29 03:46:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:02,359 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2023-11-29 03:46:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:46:02,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 26 [2023-11-29 03:46:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:02,361 INFO L225 Difference]: With dead ends: 38 [2023-11-29 03:46:02,361 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 03:46:02,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:46:02,362 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:02,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:46:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 03:46:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-29 03:46:02,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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) [2023-11-29 03:46:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-11-29 03:46:02,369 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 26 [2023-11-29 03:46:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:02,369 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-29 03:46:02,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2023-11-29 03:46:02,370 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-11-29 03:46:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:46:02,371 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:02,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:02,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 03:46:02,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:02,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:02,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash -262117536, now seen corresponding path program 1 times [2023-11-29 03:46:02,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:02,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909578113] [2023-11-29 03:46:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:02,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:02,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:02,582 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:02,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 03:46:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:02,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-29 03:46:02,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:02,952 INFO L378 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 7 [2023-11-29 03:46:03,004 INFO L378 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 [2023-11-29 03:46:03,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:46:03,282 INFO L378 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 11 treesize of output 5 [2023-11-29 03:46:03,288 INFO L378 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 [2023-11-29 03:46:03,513 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:46:03,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 03:46:03,551 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 03:46:03,552 INFO L378 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 17 treesize of output 17 [2023-11-29 03:46:03,996 INFO L378 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 39 treesize of output 15 [2023-11-29 03:46:04,108 INFO L378 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 27 treesize of output 15 [2023-11-29 03:46:04,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:46:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:46:04,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:04,342 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_229) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-11-29 03:46:04,918 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_18| (_ BitVec 32)) (v_ArrVal_233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_228 (_ BitVec 32)) (v_ArrVal_229 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_18|) (_ bv0 1))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_18| v_ArrVal_233) .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) v_ArrVal_228))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_18| v_ArrVal_229) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-11-29 03:46:04,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:46:04,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909578113] [2023-11-29 03:46:04,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909578113] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:46:04,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [220184539] [2023-11-29 03:46:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:04,922 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:46:04,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:46:04,923 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:46:04,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-11-29 03:46:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:05,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 03:46:05,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:05,308 INFO L378 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 7 [2023-11-29 03:46:05,335 INFO L378 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 [2023-11-29 03:46:05,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:46:05,728 INFO L378 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 [2023-11-29 03:46:05,732 INFO L378 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 11 treesize of output 5 [2023-11-29 03:46:10,048 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:46:10,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-29 03:46:10,074 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 03:46:10,075 INFO L378 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 17 treesize of output 17 [2023-11-29 03:46:10,618 INFO L378 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 39 treesize of output 15 [2023-11-29 03:46:10,755 INFO L378 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 27 treesize of output 15 [2023-11-29 03:46:10,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 03:46:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:46:10,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:10,789 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_303) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-11-29 03:46:11,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| (_ BitVec 32)) (v_ArrVal_307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_302 (_ BitVec 32)) (v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_307) .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) v_ArrVal_302))) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_22| v_ArrVal_303) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |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_22|) (_ bv0 1))))) is different from false [2023-11-29 03:46:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [220184539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:46:11,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:46:11,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 28 [2023-11-29 03:46:11,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296300092] [2023-11-29 03:46:11,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:11,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 03:46:11,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:46:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 03:46:11,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1138, Unknown=30, NotChecked=284, Total=1560 [2023-11-29 03:46:11,499 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 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) [2023-11-29 03:46:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:13,392 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2023-11-29 03:46:13,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:46:13,393 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 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 27 [2023-11-29 03:46:13,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:13,394 INFO L225 Difference]: With dead ends: 41 [2023-11-29 03:46:13,394 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 03:46:13,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=142, Invalid=1566, Unknown=30, NotChecked=332, Total=2070 [2023-11-29 03:46:13,396 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:13,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 211 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:46:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 03:46:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-11-29 03:46:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:46:13,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-29 03:46:13,406 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 27 [2023-11-29 03:46:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:13,406 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-29 03:46:13,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 states have internal predecessors, (33), 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) [2023-11-29 03:46:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-29 03:46:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:46:13,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:13,408 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:13,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-11-29 03:46:13,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 03:46:13,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:13,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:13,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash -260270494, now seen corresponding path program 1 times [2023-11-29 03:46:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:13,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385687668] [2023-11-29 03:46:13,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:13,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:13,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:13,811 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:13,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 03:46:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:13,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:46:13,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:14,046 INFO L378 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 [2023-11-29 03:46:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:46:14,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 03:46:14,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:46:14,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385687668] [2023-11-29 03:46:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385687668] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:46:14,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:46:14,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-11-29 03:46:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237548643] [2023-11-29 03:46:14,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:14,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:46:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:46:14,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:46:14,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:46:14,138 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 03:46:18,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:46:22,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:46:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:22,670 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2023-11-29 03:46:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:46:22,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-11-29 03:46:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:22,672 INFO L225 Difference]: With dead ends: 55 [2023-11-29 03:46:22,673 INFO L226 Difference]: Without dead ends: 45 [2023-11-29 03:46:22,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-29 03:46:22,674 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:22,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 209 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 03:46:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-29 03:46:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2023-11-29 03:46:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:46:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-11-29 03:46:22,681 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 27 [2023-11-29 03:46:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:22,682 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-11-29 03:46:22,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 03:46:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-11-29 03:46:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:46:22,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:22,683 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:22,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-29 03:46:22,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:22,883 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:22,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash 464236054, now seen corresponding path program 1 times [2023-11-29 03:46:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:22,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46541666] [2023-11-29 03:46:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:22,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:22,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:22,885 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:22,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 03:46:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:23,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:46:23,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:23,162 INFO L378 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 [2023-11-29 03:46:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 03:46:23,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:23,250 INFO L378 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 24 treesize of output 16 [2023-11-29 03:46:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-29 03:46:24,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:46:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46541666] [2023-11-29 03:46:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46541666] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:46:24,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:46:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2023-11-29 03:46:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114578195] [2023-11-29 03:46:24,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:24,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:46:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:46:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:46:24,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:46:24,394 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:46:28,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:46:32,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:46:36,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 03:46:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:37,128 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2023-11-29 03:46:37,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 03:46:37,129 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-29 03:46:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:37,130 INFO L225 Difference]: With dead ends: 56 [2023-11-29 03:46:37,130 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 03:46:37,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-11-29 03:46:37,131 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:37,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 225 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2023-11-29 03:46:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 03:46:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2023-11-29 03:46:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:46:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2023-11-29 03:46:37,141 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2023-11-29 03:46:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:37,142 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2023-11-29 03:46:37,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 03:46:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2023-11-29 03:46:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:46:37,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:37,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:37,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 03:46:37,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:37,344 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:37,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:37,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1929378297, now seen corresponding path program 2 times [2023-11-29 03:46:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674776531] [2023-11-29 03:46:37,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:46:37,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:37,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:37,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:37,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 03:46:37,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:46:37,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:46:37,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:46:37,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:46:37,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 03:46:38,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:46:38,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674776531] [2023-11-29 03:46:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674776531] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:46:38,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:46:38,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 03:46:38,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127645299] [2023-11-29 03:46:38,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:38,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:46:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:46:38,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:46:38,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:46:38,134 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:46:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:38,358 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2023-11-29 03:46:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:46:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2023-11-29 03:46:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:38,359 INFO L225 Difference]: With dead ends: 46 [2023-11-29 03:46:38,359 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 03:46:38,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:46:38,360 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:38,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 84 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:46:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 03:46:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 03:46:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:46:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-11-29 03:46:38,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 28 [2023-11-29 03:46:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:38,371 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-11-29 03:46:38,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 03:46:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-11-29 03:46:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 03:46:38,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:38,373 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:38,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 03:46:38,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:38,573 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:38,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1508130747, now seen corresponding path program 1 times [2023-11-29 03:46:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:38,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950160605] [2023-11-29 03:46:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:38,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:38,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:38,575 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:38,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 03:46:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:38,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:46:38,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 03:46:38,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-29 03:46:39,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:46:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950160605] [2023-11-29 03:46:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950160605] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:46:39,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:46:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-11-29 03:46:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897278469] [2023-11-29 03:46:39,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:46:39,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:46:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:46:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:46:39,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 03:46:39,334 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2023-11-29 03:46:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:46:39,554 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-29 03:46:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:46:39,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) Word has length 29 [2023-11-29 03:46:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:46:39,555 INFO L225 Difference]: With dead ends: 42 [2023-11-29 03:46:39,555 INFO L226 Difference]: Without dead ends: 33 [2023-11-29 03:46:39,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:46:39,556 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:46:39,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 60 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:46:39,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-29 03:46:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-29 03:46:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 03:46:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-29 03:46:39,563 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2023-11-29 03:46:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:46:39,564 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-29 03:46:39,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2023-11-29 03:46:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-29 03:46:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:46:39,564 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:46:39,565 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:46:39,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-29 03:46:39,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:39,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:46:39,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:46:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash -492642021, now seen corresponding path program 1 times [2023-11-29 03:46:39,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:46:39,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209200098] [2023-11-29 03:46:39,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:46:39,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:46:39,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:46:39,767 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 03:46:39,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e064331a-c023-4de3-8551-bab71ccef2fa/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 03:46:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:46:39,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 03:46:39,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:46:39,993 INFO L378 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 7 [2023-11-29 03:46:40,130 INFO L378 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 11 treesize of output 5 [2023-11-29 03:46:40,215 INFO L378 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 [2023-11-29 03:46:40,309 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 03:46:40,310 INFO L378 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 17 treesize of output 17 [2023-11-29 03:46:40,714 INFO L378 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 11 [2023-11-29 03:46:40,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:46:40,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:46:40,875 INFO L378 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 137 treesize of output 89 [2023-11-29 03:46:40,899 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:46:40,899 INFO L378 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 79 treesize of output 68 [2023-11-29 03:46:40,904 INFO L378 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 11 [2023-11-29 03:46:40,913 INFO L378 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 39 treesize of output 15 [2023-11-29 03:46:41,001 INFO L378 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 27 treesize of output 15 [2023-11-29 03:46:41,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:46:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 03:46:41,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:46:41,457 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (_ BitVec 32)) (v_ArrVal_626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_624)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_626) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_627) .cse0) .cse1))))) is different from false [2023-11-29 03:46:41,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:41,484 INFO L378 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 77 treesize of output 78 [2023-11-29 03:46:41,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:41,528 INFO L378 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 150 treesize of output 149 [2023-11-29 03:46:41,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:41,549 INFO L378 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 126 treesize of output 116 [2023-11-29 03:46:41,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:46:41,595 INFO L378 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 216 treesize of output 201 [2023-11-29 03:46:41,610 INFO L378 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 47 treesize of output 39 [2023-11-29 03:46:41,622 INFO L378 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 39 treesize of output 31 [2023-11-29 03:46:55,676 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (.cse4 (= .cse17 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (let ((.cse1 (= .cse17 |c_ULTIMATE.start_sll_insert_~last~0#1.base|)) (.cse7 (and (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_623))) (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_624))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_36) v_arrayElimCell_37))))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_623))) (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_624))) v_arrayElimCell_32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) .cse4))) (.cse0 (and (or .cse4 (forall ((v_ArrVal_624 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_624) v_arrayElimCell_34)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_623))) (store .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_624))))) (or (= (select (select .cse9 v_arrayElimCell_32) v_arrayElimCell_34) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_36) v_arrayElimCell_37))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_623))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_624))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse12) v_arrayElimCell_36) v_arrayElimCell_37)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_34)))))) (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_623))) (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_624))) v_arrayElimCell_32) v_arrayElimCell_34) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse4))) (.cse8 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (or .cse0 .cse1) (or (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_623))) (store .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse3 v_ArrVal_624))) v_arrayElimCell_36) v_arrayElimCell_37))) (not .cse4)) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_623))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse6 .cse3 v_ArrVal_624)) v_arrayElimCell_36) v_arrayElimCell_37)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse6 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))))) (or .cse1 .cse7) (or .cse7 .cse8) (or .cse0 .cse8) (or (forall ((v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) .cse4))))) is different from false [2023-11-29 03:46:57,345 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse3 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse13))) (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (.cse1 (and (or .cse3 (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse14 (store |c_#memory_int#1| .cse6 v_ArrVal_623))) (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_624))) v_arrayElimCell_32) v_arrayElimCell_34)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int#1| .cse6 v_ArrVal_623))) (let ((.cse16 (store (select .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_624))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse16) v_arrayElimCell_36) v_arrayElimCell_37)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 v_arrayElimCell_34)))))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (let ((.cse18 (store |c_#memory_int#1| .cse6 v_ArrVal_623))) (store .cse18 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse18 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_624))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_36) v_arrayElimCell_37)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse17 v_arrayElimCell_32) v_arrayElimCell_34))))) (or (forall ((v_ArrVal_624 (_ BitVec 32)) (v_arrayElimCell_34 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| .cse6 v_ArrVal_623) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_624) v_arrayElimCell_34))) .cse3))) (.cse9 (= .cse13 .cse6)) (.cse2 (and (or (forall ((v_arrayElimCell_32 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse10 (store |c_#memory_int#1| .cse6 v_ArrVal_623))) (store .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_624))) v_arrayElimCell_32) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse3) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (let ((.cse12 (store |c_#memory_int#1| .cse6 v_ArrVal_623))) (store .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_624))))) (or (= (select (select .cse11 v_arrayElimCell_32) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_36) v_arrayElimCell_37)))))))) (and (or .cse0 .cse1) (or .cse2 .cse0) (or (not .cse3) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse4 (store |c_#memory_int#1| .cse6 v_ArrVal_623))) (store .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_ArrVal_624))) v_arrayElimCell_36) v_arrayElimCell_37)))) (forall ((v_arrayElimCell_36 (_ BitVec 32)) (v_arrayElimCell_37 (_ BitVec 32)) (v_ArrVal_624 (_ BitVec 32)) (v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_int#1| .cse6 v_ArrVal_623))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store .cse7 .cse5 v_ArrVal_624)) v_arrayElimCell_36) v_arrayElimCell_37)))))) (or .cse3 (forall ((v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse6 v_ArrVal_623) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)))) (or .cse9 .cse1) (or .cse9 .cse2))))) is different from false