./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.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_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:18:36,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:18:36,996 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:18:37,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:18:37,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:18:37,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:18:37,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:18:37,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:18:37,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:18:37,031 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:18:37,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:18:37,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:18:37,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:18:37,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:18:37,034 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:18:37,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:18:37,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:18:37,036 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:18:37,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:18:37,037 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:18:37,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:18:37,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:18:37,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:18:37,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:18:37,040 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:18:37,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:18:37,040 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:18:37,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:18:37,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:18:37,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:18:37,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:18:37,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:18:37,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:18:37,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:18:37,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:18:37,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:18:37,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:18:37,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:18:37,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:18:37,045 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:18:37,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:18:37,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:18:37,045 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_3b6530ab-a99c-4aa8-873d-49c387ee6585/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_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-11-29 05:18:37,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:18:37,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:18:37,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:18:37,328 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:18:37,328 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:18:37,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-29 05:18:40,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:18:40,376 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:18:40,376 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-29 05:18:40,392 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/data/c294d6bd8/a7c402d8db234c718b673e840e8cec81/FLAG85e8c5af7 [2023-11-29 05:18:40,405 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/data/c294d6bd8/a7c402d8db234c718b673e840e8cec81 [2023-11-29 05:18:40,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:18:40,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:18:40,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:18:40,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:18:40,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:18:40,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737cd671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40, skipping insertion in model container [2023-11-29 05:18:40,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,463 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:18:40,729 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_3b6530ab-a99c-4aa8-873d-49c387ee6585/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-29 05:18:40,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:18:40,745 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:18:40,790 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_3b6530ab-a99c-4aa8-873d-49c387ee6585/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-29 05:18:40,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:18:40,819 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:18:40,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40 WrapperNode [2023-11-29 05:18:40,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:18:40,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:18:40,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:18:40,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:18:40,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,869 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2023-11-29 05:18:40,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:18:40,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:18:40,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:18:40,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:18:40,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,908 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 14, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2023-11-29 05:18:40,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:18:40,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:18:40,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:18:40,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:18:40,934 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (1/1) ... [2023-11-29 05:18:40,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:18:40,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:40,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:18:40,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:18:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 05:18:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 05:18:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 05:18:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:18:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:18:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:18:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 05:18:40,995 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 05:18:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:18:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:18:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:18:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:18:40,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:18:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:18:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:18:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:18:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:18:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:18:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:18:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:18:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:18:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:18:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:18:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:18:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:18:40,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:18:41,137 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:18:41,139 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:18:41,354 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:18:41,391 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:18:41,391 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 05:18:41,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:18:41 BoogieIcfgContainer [2023-11-29 05:18:41,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:18:41,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:18:41,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:18:41,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:18:41,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:18:40" (1/3) ... [2023-11-29 05:18:41,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7403c4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:18:41, skipping insertion in model container [2023-11-29 05:18:41,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:18:40" (2/3) ... [2023-11-29 05:18:41,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7403c4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:18:41, skipping insertion in model container [2023-11-29 05:18:41,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:18:41" (3/3) ... [2023-11-29 05:18:41,401 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-11-29 05:18:41,439 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:18:41,439 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:18:41,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:18:41,495 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;@b56d019, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:18:41,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:18:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:18:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:18:41,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:41,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:41,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:41,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 714646386, now seen corresponding path program 1 times [2023-11-29 05:18:41,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:41,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625390799] [2023-11-29 05:18:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:41,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:41,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:18:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:18:41,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625390799] [2023-11-29 05:18:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625390799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:41,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:41,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:18:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900586471] [2023-11-29 05:18:41,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:41,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:18:41,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:41,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:18:41,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:18:41,862 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 05:18:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:41,935 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2023-11-29 05:18:41,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:18:41,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2023-11-29 05:18:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:41,943 INFO L225 Difference]: With dead ends: 54 [2023-11-29 05:18:41,943 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 05:18:41,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 05:18:41,949 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 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 05:18:41,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 05:18:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-29 05:18:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 05:18:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-11-29 05:18:41,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 19 [2023-11-29 05:18:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:41,981 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-11-29 05:18:41,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 05:18:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-11-29 05:18:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:18:41,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:41,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:41,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:18:41,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:41,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1934433391, now seen corresponding path program 1 times [2023-11-29 05:18:41,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:41,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899873097] [2023-11-29 05:18:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:42,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:42,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:18:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:18:42,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899873097] [2023-11-29 05:18:42,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899873097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:42,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:42,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:18:42,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866086851] [2023-11-29 05:18:42,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:42,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:42,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:42,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:18:42,215 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 05:18:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:42,300 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2023-11-29 05:18:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:42,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2023-11-29 05:18:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:42,301 INFO L225 Difference]: With dead ends: 43 [2023-11-29 05:18:42,301 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 05:18:42,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 05:18:42,304 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:42,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 05:18:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-29 05:18:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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 05:18:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-29 05:18:42,312 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 19 [2023-11-29 05:18:42,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:42,312 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-29 05:18:42,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 05:18:42,313 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-29 05:18:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:18:42,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:42,314 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:42,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:18:42,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:42,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1461155078, now seen corresponding path program 1 times [2023-11-29 05:18:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:42,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484074468] [2023-11-29 05:18:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:42,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:18:42,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:42,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484074468] [2023-11-29 05:18:42,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484074468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:42,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:42,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:18:42,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919583939] [2023-11-29 05:18:42,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:42,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:18:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:42,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:18:42,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:18:42,481 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:18:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:42,534 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2023-11-29 05:18:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:18:42,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 05:18:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:42,536 INFO L225 Difference]: With dead ends: 34 [2023-11-29 05:18:42,537 INFO L226 Difference]: Without dead ends: 27 [2023-11-29 05:18:42,537 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 05:18:42,538 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:42,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-29 05:18:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-11-29 05:18:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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 05:18:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-29 05:18:42,546 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 25 [2023-11-29 05:18:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:42,547 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-29 05:18:42,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:18:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-29 05:18:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:18:42,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:42,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:42,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:18:42,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:42,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:42,550 INFO L85 PathProgramCache]: Analyzing trace with hash -810442196, now seen corresponding path program 1 times [2023-11-29 05:18:42,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:42,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47717757] [2023-11-29 05:18:42,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:42,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:44,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:44,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:18:44,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:44,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47717757] [2023-11-29 05:18:44,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47717757] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:44,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201535025] [2023-11-29 05:18:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:44,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:44,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:44,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:18:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:44,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-29 05:18:44,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:45,046 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 05:18:45,323 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 05:18:45,414 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:18:45,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 05:18:45,507 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 23 treesize of output 11 [2023-11-29 05:18:45,621 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 05:18:45,771 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 11 treesize of output 3 [2023-11-29 05:18:45,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:18:46,047 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-11-29 05:18:46,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 05:18:46,064 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 05:18:46,398 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-11-29 05:18:46,404 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 05:18:46,487 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 05:18:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:18:46,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:47,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201535025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:47,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:18:47,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2023-11-29 05:18:47,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529462945] [2023-11-29 05:18:47,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:47,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 05:18:47,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:47,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 05:18:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1974, Unknown=33, NotChecked=0, Total=2162 [2023-11-29 05:18:47,276 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:18:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:48,580 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2023-11-29 05:18:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 05:18:48,581 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-29 05:18:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:48,582 INFO L225 Difference]: With dead ends: 48 [2023-11-29 05:18:48,582 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 05:18:48,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=288, Invalid=3339, Unknown=33, NotChecked=0, Total=3660 [2023-11-29 05:18:48,585 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:48,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 275 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:18:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 05:18:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2023-11-29 05:18:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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 05:18:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2023-11-29 05:18:48,594 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 26 [2023-11-29 05:18:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:48,595 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-11-29 05:18:48,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:18:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2023-11-29 05:18:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:18:48,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:48,596 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:48,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:18:48,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:48,804 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:48,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2113179334, now seen corresponding path program 2 times [2023-11-29 05:18:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:48,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352784643] [2023-11-29 05:18:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:48,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:48,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:48,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:48,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:18:49,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:49,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352784643] [2023-11-29 05:18:49,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352784643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:49,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:49,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:18:49,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384437381] [2023-11-29 05:18:49,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:49,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:18:49,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:49,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:18:49,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:18:49,005 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:18:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:49,065 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2023-11-29 05:18:49,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:18:49,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-29 05:18:49,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:49,067 INFO L225 Difference]: With dead ends: 43 [2023-11-29 05:18:49,067 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 05:18:49,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:18:49,068 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:49,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 54 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 05:18:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 05:18:49,075 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 05:18:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-11-29 05:18:49,076 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 27 [2023-11-29 05:18:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:49,077 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-11-29 05:18:49,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:18:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-11-29 05:18:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:18:49,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:49,078 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:49,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:18:49,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:49,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1881720096, now seen corresponding path program 1 times [2023-11-29 05:18:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694671625] [2023-11-29 05:18:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:49,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:18:49,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:49,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694671625] [2023-11-29 05:18:49,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694671625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:18:49,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:18:49,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:18:49,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222065942] [2023-11-29 05:18:49,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:18:49,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:18:49,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:49,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:18:49,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:18:49,230 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:18:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:49,283 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-11-29 05:18:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:18:49,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-29 05:18:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:49,286 INFO L225 Difference]: With dead ends: 41 [2023-11-29 05:18:49,286 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 05:18:49,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:18:49,287 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:49,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:18:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 05:18:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 05:18:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 05:18:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-29 05:18:49,294 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 27 [2023-11-29 05:18:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:49,295 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-29 05:18:49,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:18:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-29 05:18:49,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:18:49,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:49,296 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:49,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:18:49,296 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:49,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1443991612, now seen corresponding path program 1 times [2023-11-29 05:18:49,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:49,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512533197] [2023-11-29 05:18:49,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:49,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:49,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:18:49,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:49,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512533197] [2023-11-29 05:18:49,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512533197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:49,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464869057] [2023-11-29 05:18:49,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:49,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:49,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:49,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:49,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:18:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:50,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 05:18:50,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:50,124 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 05:18:50,256 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 05:18:50,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-29 05:18:50,297 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 11 treesize of output 7 [2023-11-29 05:18:50,357 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 05:18:50,358 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 70 treesize of output 57 [2023-11-29 05:18:50,403 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 38 treesize of output 14 [2023-11-29 05:18:50,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 05:18:50,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:18:50,514 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 46 treesize of output 35 [2023-11-29 05:18:50,540 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-11-29 05:18:50,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-11-29 05:18:50,660 INFO L349 Elim1Store]: treesize reduction 33, result has 48.4 percent of original size [2023-11-29 05:18:50,660 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 59 [2023-11-29 05:18:50,680 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-11-29 05:18:50,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2023-11-29 05:18:50,703 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 22 treesize of output 16 [2023-11-29 05:18:50,729 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 28 treesize of output 20 [2023-11-29 05:18:50,765 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 35 treesize of output 19 [2023-11-29 05:18:50,767 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 05:18:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:18:50,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:51,015 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| Int) (v_ArrVal_783 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16|) 0)) (not (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|))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_783) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_780) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0))))) is different from false [2023-11-29 05:18:51,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464869057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:51,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:18:51,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 30 [2023-11-29 05:18:51,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616044122] [2023-11-29 05:18:51,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:51,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 05:18:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:51,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 05:18:51,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=893, Unknown=19, NotChecked=60, Total=1056 [2023-11-29 05:18:51,020 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:18:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:51,711 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2023-11-29 05:18:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:18:51,712 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-29 05:18:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:51,712 INFO L225 Difference]: With dead ends: 55 [2023-11-29 05:18:51,712 INFO L226 Difference]: Without dead ends: 52 [2023-11-29 05:18:51,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=1879, Unknown=21, NotChecked=88, Total=2162 [2023-11-29 05:18:51,714 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:51,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 278 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:18:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-29 05:18:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 32. [2023-11-29 05:18:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 05:18:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-29 05:18:51,731 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2023-11-29 05:18:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:51,731 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-29 05:18:51,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 22 states have internal predecessors, (39), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:18:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-29 05:18:51,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:18:51,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:51,733 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:51,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:18:51,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:51,936 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:51,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:51,936 INFO L85 PathProgramCache]: Analyzing trace with hash 151574482, now seen corresponding path program 1 times [2023-11-29 05:18:51,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:51,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423414677] [2023-11-29 05:18:51,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:18:52,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423414677] [2023-11-29 05:18:52,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423414677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:52,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629498104] [2023-11-29 05:18:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:52,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:52,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:52,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:18:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 05:18:52,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:18:52,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:18:52,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629498104] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:52,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:52,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-11-29 05:18:52,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098623310] [2023-11-29 05:18:52,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:18:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:52,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:18:52,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:18:52,364 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:18:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:52,473 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-11-29 05:18:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:18:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2023-11-29 05:18:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:52,476 INFO L225 Difference]: With dead ends: 40 [2023-11-29 05:18:52,476 INFO L226 Difference]: Without dead ends: 32 [2023-11-29 05:18:52,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:18:52,478 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:52,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 99 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:18:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-29 05:18:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-29 05:18:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 05:18:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-11-29 05:18:52,487 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 28 [2023-11-29 05:18:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:52,488 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-11-29 05:18:52,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 05:18:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-11-29 05:18:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:18:52,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:52,489 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:52,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:18:52,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:52,695 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:18:52,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash 208832784, now seen corresponding path program 1 times [2023-11-29 05:18:52,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:18:52,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521239207] [2023-11-29 05:18:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:52,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:18:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:18:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:18:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:18:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:18:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:18:52,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521239207] [2023-11-29 05:18:52,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521239207] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:18:52,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253441470] [2023-11-29 05:18:52,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:52,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:18:52,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:18:52,975 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:18:52,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:18:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:53,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 05:18:53,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:53,298 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 05:18:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:18:53,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:53,356 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 05:18:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:18:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253441470] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:18:53,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:18:53,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 18 [2023-11-29 05:18:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016257613] [2023-11-29 05:18:53,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:18:53,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 05:18:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:18:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 05:18:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:18:53,380 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 05:18:57,391 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 05:19:01,400 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 05:19:05,412 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 05:19:09,444 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 05:19:13,648 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 05:19:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:19:13,650 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2023-11-29 05:19:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:19:13,650 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 28 [2023-11-29 05:19:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:19:13,651 INFO L225 Difference]: With dead ends: 40 [2023-11-29 05:19:13,651 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 05:19:13,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 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 05:19:13,652 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:19:13,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 225 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2023-11-29 05:19:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 05:19:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-29 05:19:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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 05:19:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-11-29 05:19:13,660 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 28 [2023-11-29 05:19:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:19:13,660 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-11-29 05:19:13,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 15 states have internal predecessors, (36), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-11-29 05:19:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-11-29 05:19:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 05:19:13,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:19:13,661 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:19:13,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:19:13,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:13,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:19:13,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:19:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1814025842, now seen corresponding path program 1 times [2023-11-29 05:19:13,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:19:13,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435526469] [2023-11-29 05:19:13,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:13,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:19:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:14,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:19:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:14,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:19:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:14,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:19:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:19:14,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:19:14,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435526469] [2023-11-29 05:19:14,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435526469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:19:14,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756257905] [2023-11-29 05:19:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:19:14,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:19:14,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:19:14,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:19:14,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:19:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:19:15,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-29 05:19:15,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:19:15,184 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 05:19:15,344 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 05:19:15,415 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 05:19:15,495 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 05:19:15,496 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 05:19:15,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:19:15,779 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 30 treesize of output 27 [2023-11-29 05:19:15,784 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 05:19:15,790 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 05:19:15,804 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:19:15,804 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 93 treesize of output 62 [2023-11-29 05:19:15,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2023-11-29 05:19:15,818 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 36 treesize of output 15 [2023-11-29 05:19:15,892 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 50 treesize of output 30 [2023-11-29 05:19:15,985 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 05:19:15,989 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 05:19:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:19:16,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:19:16,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:16,158 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 69 treesize of output 70 [2023-11-29 05:19:16,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:16,168 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 136 treesize of output 139 [2023-11-29 05:19:16,174 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 60 treesize of output 54 [2023-11-29 05:19:16,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:16,180 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 110 treesize of output 102 [2023-11-29 05:19:16,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:16,202 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 190 treesize of output 181 [2023-11-29 05:19:16,209 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 37 treesize of output 31 [2023-11-29 05:19:16,448 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 ((.cse5 (= .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse7 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse17)) (.cse1 (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_45 Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse11 v_arrayElimCell_45) .cse7))))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (let ((.cse13 (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_45) (+ 4 v_arrayElimCell_48)))))) (or .cse5 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))) v_arrayElimCell_45) (+ 4 v_arrayElimCell_48))))) (or .cse5 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))) v_arrayElimCell_45) .cse7)))))) (.cse2 (and (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283) (+ 4 v_arrayElimCell_48)))) .cse5) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (let ((.cse9 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ 4 v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse9) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))))))))) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283))) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49)))) (not .cse5)) (or .cse3 .cse1) (or .cse2 .cse0) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse6 .cse7)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1283)) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))))))) (or .cse5 (forall ((v_ArrVal_1280 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse7)))))))) is different from false [2023-11-29 05:19:17,316 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (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 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse7 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse18)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (= .cse5 .cse18)) (.cse8 (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_45) (+ 4 v_arrayElimCell_48)))))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_45 Int)) (let ((.cse14 (let ((.cse15 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_45) .cse3))))) (or .cse7 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse16 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))) v_arrayElimCell_45) .cse3)))) (or .cse7 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_48 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse17 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))) v_arrayElimCell_45) (+ 4 v_arrayElimCell_48))))))) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#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|))) (.cse1 (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int) (v_arrayElimCell_48 Int)) (let ((.cse10 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse11) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse11 (+ 4 v_arrayElimCell_48))))))) (or .cse7 (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse5 v_ArrVal_1280) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283) (+ 4 v_arrayElimCell_48)))))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (let ((.cse4 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283)) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49))))))) (or (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1283 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_49 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse6 (store |c_#memory_int#1| .cse5 v_ArrVal_1280))) (store .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1283))) v_arrayElimCell_46) (+ 4 v_arrayElimCell_49)))) (not .cse7)) (or .cse0 .cse8) (or .cse7 (forall ((v_ArrVal_1280 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse5 v_ArrVal_1280) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse3)))) (or .cse9 .cse8) (or .cse9 .cse1))))) is different from false [2023-11-29 05:19:26,941 WARN L293 SmtUtils]: Spent 9.41s on a formula simplification. DAG size of input: 808 DAG size of output: 760 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 05:19:26,942 INFO L349 Elim1Store]: treesize reduction 252, result has 86.4 percent of original size [2023-11-29 05:19:26,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 17 new quantified variables, introduced 137 case distinctions, treesize of input 3231 treesize of output 4228 [2023-11-29 05:19:27,851 INFO L224 Elim1Store]: Index analysis took 254 ms [2023-11-29 05:19:31,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:31,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2664 treesize of output 3642 [2023-11-29 05:19:32,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:32,484 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 2343 treesize of output 2328 [2023-11-29 05:19:33,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:33,383 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 2347 treesize of output 2338 [2023-11-29 05:19:34,266 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 2357 treesize of output 2345 [2023-11-29 05:19:35,094 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 2345 treesize of output 2339 [2023-11-29 05:19:35,942 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 2339 treesize of output 2337 [2023-11-29 05:19:36,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:36,818 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 2393 treesize of output 2378 [2023-11-29 05:19:37,666 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 2397 treesize of output 2385 [2023-11-29 05:19:38,483 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 2413 treesize of output 2401 [2023-11-29 05:19:39,299 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 2401 treesize of output 2395 [2023-11-29 05:19:40,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:40,177 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 2423 treesize of output 2414 [2023-11-29 05:19:41,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:41,067 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 2447 treesize of output 2440 [2023-11-29 05:19:41,915 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 2445 treesize of output 2441 [2023-11-29 05:19:42,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:42,802 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 2469 treesize of output 2464 [2023-11-29 05:19:43,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:19:43,718 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 2497 treesize of output 2490 [2023-11-29 05:19:44,613 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 2495 treesize of output 2491 [2023-11-29 05:24:53,386 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 8 treesize of output 4 [2023-11-29 05:25:17,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 05:25:17,872 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:17,874 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-29 05:25:17,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:25:18,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 05:25:18,075 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_3b6530ab-a99c-4aa8-873d-49c387ee6585/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.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.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.SimplifyDDA2.simplify(SimplifyDDA2.java:500) 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:133) 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) ... 68 more [2023-11-29 05:25:18,077 INFO L158 Benchmark]: Toolchain (without parser) took 397668.59ms. Allocated memory was 140.5MB in the beginning and 358.6MB in the end (delta: 218.1MB). Free memory was 101.3MB in the beginning and 247.1MB in the end (delta: -145.9MB). Peak memory consumption was 219.3MB. Max. memory is 16.1GB. [2023-11-29 05:25:18,078 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:25:18,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 409.32ms. Allocated memory is still 140.5MB. Free memory was 101.3MB in the beginning and 83.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 05:25:18,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 140.5MB. Free memory was 83.3MB in the beginning and 80.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:25:18,078 INFO L158 Benchmark]: Boogie Preprocessor took 61.60ms. Allocated memory is still 140.5MB. Free memory was 80.7MB in the beginning and 77.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:25:18,078 INFO L158 Benchmark]: RCFGBuilder took 459.36ms. Allocated memory is still 140.5MB. Free memory was 77.3MB in the beginning and 57.2MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 05:25:18,079 INFO L158 Benchmark]: TraceAbstraction took 396682.25ms. Allocated memory was 140.5MB in the beginning and 358.6MB in the end (delta: 218.1MB). Free memory was 56.3MB in the beginning and 247.1MB in the end (delta: -190.8MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. [2023-11-29 05:25:18,080 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.17ms. Allocated memory is still 102.8MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 409.32ms. Allocated memory is still 140.5MB. Free memory was 101.3MB in the beginning and 83.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 140.5MB. Free memory was 83.3MB in the beginning and 80.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.60ms. Allocated memory is still 140.5MB. Free memory was 80.7MB in the beginning and 77.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.36ms. Allocated memory is still 140.5MB. Free memory was 77.3MB in the beginning and 57.2MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 396682.25ms. Allocated memory was 140.5MB in the beginning and 358.6MB in the end (delta: 218.1MB). Free memory was 56.3MB in the beginning and 247.1MB in the end (delta: -190.8MB). Peak memory consumption was 175.2MB. 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_3b6530ab-a99c-4aa8-873d-49c387ee6585/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_3b6530ab-a99c-4aa8-873d-49c387ee6585/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_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:25:19,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:25:19,844 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:25:19,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:25:19,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:25:19,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:25:19,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:25:19,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:25:19,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:25:19,882 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:25:19,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:25:19,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:25:19,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:25:19,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:25:19,885 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:25:19,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:25:19,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:25:19,887 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:25:19,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:25:19,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:25:19,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:25:19,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:25:19,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:25:19,890 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:25:19,890 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:25:19,891 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:25:19,891 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:25:19,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:25:19,892 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:25:19,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:25:19,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:25:19,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:25:19,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:25:19,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:25:19,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:25:19,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:25:19,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:25:19,895 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:25:19,895 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:25:19,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:25:19,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:25:19,896 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:25:19,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:25:19,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:25:19,897 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:25:19,897 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_3b6530ab-a99c-4aa8-873d-49c387ee6585/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_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-11-29 05:25:20,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:25:20,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:25:20,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:25:20,204 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:25:20,204 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:25:20,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-29 05:25:22,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:25:23,246 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:25:23,247 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-11-29 05:25:23,261 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/data/c138aac80/b15e03096cbc427faed4b02bd9a35247/FLAGe75676f33 [2023-11-29 05:25:23,276 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/data/c138aac80/b15e03096cbc427faed4b02bd9a35247 [2023-11-29 05:25:23,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:25:23,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:25:23,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:25:23,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:25:23,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:25:23,289 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@773ba24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23, skipping insertion in model container [2023-11-29 05:25:23,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,335 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:25:23,635 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_3b6530ab-a99c-4aa8-873d-49c387ee6585/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-29 05:25:23,639 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:25:23,653 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:25:23,695 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_3b6530ab-a99c-4aa8-873d-49c387ee6585/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-11-29 05:25:23,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:25:23,752 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:25:23,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23 WrapperNode [2023-11-29 05:25:23,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:25:23,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:25:23,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:25:23,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:25:23,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,810 INFO L138 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 144 [2023-11-29 05:25:23,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:25:23,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:25:23,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:25:23,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:25:23,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,845 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 14, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2023-11-29 05:25:23,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:25:23,874 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:25:23,874 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:25:23,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:25:23,875 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (1/1) ... [2023-11-29 05:25:23,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:25:23,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:25:23,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:25:23,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:25:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 05:25:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 05:25:23,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 05:25:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-29 05:25:23,939 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-29 05:25:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:25:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:25:23,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:25:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:25:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:25:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:25:23,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:25:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:25:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:25:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:25:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:25:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:25:23,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:25:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 05:25:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 05:25:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 05:25:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:25:23,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:25:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:25:23,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:25:23,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:25:24,076 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:25:24,078 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:25:24,410 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:25:24,444 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:25:24,445 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 05:25:24,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:25:24 BoogieIcfgContainer [2023-11-29 05:25:24,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:25:24,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:25:24,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:25:24,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:25:24,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:25:23" (1/3) ... [2023-11-29 05:25:24,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7671c295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:25:24, skipping insertion in model container [2023-11-29 05:25:24,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:25:23" (2/3) ... [2023-11-29 05:25:24,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7671c295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:25:24, skipping insertion in model container [2023-11-29 05:25:24,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:25:24" (3/3) ... [2023-11-29 05:25:24,454 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-11-29 05:25:24,500 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:25:24,500 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:25:24,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:25:24,555 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;@6b7ce787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:25:24,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:25:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:25:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:25:24,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:24,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:24,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:24,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:24,574 INFO L85 PathProgramCache]: Analyzing trace with hash 714646386, now seen corresponding path program 1 times [2023-11-29 05:25:24,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:24,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522309144] [2023-11-29 05:25:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:24,588 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 05:25:24,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:24,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:24,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:24,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:25:24,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 05:25:24,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:25:24,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522309144] [2023-11-29 05:25:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522309144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:24,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:24,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:25:24,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320856353] [2023-11-29 05:25:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:24,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:25:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:24,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:25:24,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:25:24,856 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 05:25:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:24,918 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2023-11-29 05:25:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:25:24,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 19 [2023-11-29 05:25:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:24,925 INFO L225 Difference]: With dead ends: 54 [2023-11-29 05:25:24,926 INFO L226 Difference]: Without dead ends: 23 [2023-11-29 05:25:24,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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 05:25:24,931 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:24,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:25:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-29 05:25:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-29 05:25:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 05:25:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-11-29 05:25:24,960 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 19 [2023-11-29 05:25:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:24,961 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-11-29 05:25:24,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 05:25:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-11-29 05:25:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 05:25:24,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:24,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:24,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:25,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:25,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:25,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:25,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1934433391, now seen corresponding path program 1 times [2023-11-29 05:25:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576434504] [2023-11-29 05:25:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:25,166 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 05:25:25,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:25,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:25,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:25:25,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:25,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:25:25,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576434504] [2023-11-29 05:25:25,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576434504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:25,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:25,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:25:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487734958] [2023-11-29 05:25:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:25:25,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:25,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:25:25,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:25:25,366 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:25:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:25,469 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2023-11-29 05:25:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:25:25,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-29 05:25:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:25,471 INFO L225 Difference]: With dead ends: 43 [2023-11-29 05:25:25,471 INFO L226 Difference]: Without dead ends: 26 [2023-11-29 05:25:25,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 05:25:25,473 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 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 05:25:25,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-29 05:25:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-29 05:25:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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 05:25:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-29 05:25:25,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 19 [2023-11-29 05:25:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:25,482 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-29 05:25:25,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 05:25:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-29 05:25:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:25:25,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:25,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:25,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:25,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:25,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:25,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1461155078, now seen corresponding path program 1 times [2023-11-29 05:25:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242587371] [2023-11-29 05:25:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:25,689 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 05:25:25,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:25,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:25,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:25,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:25:25,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:25:25,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:25:25,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:25,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242587371] [2023-11-29 05:25:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242587371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:25:25,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:25:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:25:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882607726] [2023-11-29 05:25:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:25:25,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:25:25,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:25:25,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:25:25,891 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:25:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:25,990 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-11-29 05:25:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:25:25,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-11-29 05:25:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:25,992 INFO L225 Difference]: With dead ends: 35 [2023-11-29 05:25:25,992 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 05:25:25,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 05:25:25,994 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:25,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 05:25:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 05:25:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 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 05:25:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-29 05:25:26,002 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 25 [2023-11-29 05:25:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:26,003 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-29 05:25:26,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:25:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-29 05:25:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:25:26,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:26,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:26,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:26,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:26,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:26,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash -810442196, now seen corresponding path program 1 times [2023-11-29 05:25:26,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:26,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456354590] [2023-11-29 05:25:26,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:26,207 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 05:25:26,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:26,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:26,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:26,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 05:25:26,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:26,527 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 05:25:26,701 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 05:25:26,805 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:25:26,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:25:26,919 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 23 treesize of output 11 [2023-11-29 05:25:27,073 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 05:25:27,231 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 11 treesize of output 3 [2023-11-29 05:25:27,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:25:27,533 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 05:25:27,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-11-29 05:25:27,560 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 05:25:28,053 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-29 05:25:28,061 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 05:25:28,172 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 05:25:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:28,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:29,135 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| (_ BitVec 32)) (v_ArrVal_222 (_ BitVec 32)) (v_ArrVal_227 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12|))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| v_ArrVal_227) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_222))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| v_ArrVal_223) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (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|)))))) is different from false [2023-11-29 05:25:29,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:29,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456354590] [2023-11-29 05:25:29,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456354590] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:25:29,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [388064667] [2023-11-29 05:25:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:29,142 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:25:29,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:25:29,145 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:25:29,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-11-29 05:25:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:29,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 05:25:29,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:29,557 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 05:25:29,822 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 05:25:29,886 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:25:29,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 05:25:30,036 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 23 treesize of output 11 [2023-11-29 05:25:30,218 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 05:25:30,403 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 11 treesize of output 3 [2023-11-29 05:25:30,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 05:25:34,760 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-29 05:25:34,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-11-29 05:25:34,771 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 05:25:35,287 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-29 05:25:35,293 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 05:25:35,428 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 05:25:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:25:35,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:36,189 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| (_ BitVec 32)) (v_ArrVal_298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_299 (_ 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_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_303) .cse0) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_299))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16| v_ArrVal_298) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (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|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 05:25:36,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [388064667] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:25:36,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:25:36,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2023-11-29 05:25:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633978967] [2023-11-29 05:25:36,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:25:36,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 05:25:36,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:36,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 05:25:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1704, Unknown=48, NotChecked=170, Total=2070 [2023-11-29 05:25:36,198 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:25:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:40,345 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2023-11-29 05:25:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 05:25:40,346 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-11-29 05:25:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:40,348 INFO L225 Difference]: With dead ends: 44 [2023-11-29 05:25:40,348 INFO L226 Difference]: Without dead ends: 42 [2023-11-29 05:25:40,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=235, Invalid=2587, Unknown=48, NotChecked=210, Total=3080 [2023-11-29 05:25:40,351 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:40,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 234 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 05:25:40,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-29 05:25:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2023-11-29 05:25:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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 05:25:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2023-11-29 05:25:40,363 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 26 [2023-11-29 05:25:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:40,364 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-11-29 05:25:40,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 25 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 05:25:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2023-11-29 05:25:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 05:25:40,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:40,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:40,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-11-29 05:25:40,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:40,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:40,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:40,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2113179334, now seen corresponding path program 2 times [2023-11-29 05:25:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:40,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738389885] [2023-11-29 05:25:40,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:25:40,768 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 05:25:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:40,769 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:40,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 (7)] Waiting until timeout for monitored process [2023-11-29 05:25:40,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:25:40,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:25:40,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:25:40,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:25:40,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 05:25:41,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:41,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738389885] [2023-11-29 05:25:41,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738389885] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:25:41,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:25:41,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 05:25:41,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184492659] [2023-11-29 05:25:41,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:25:41,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:25:41,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:41,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:25:41,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:25:41,488 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:25:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:41,652 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-11-29 05:25:41,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:25:41,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-11-29 05:25:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:41,653 INFO L225 Difference]: With dead ends: 42 [2023-11-29 05:25:41,653 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 05:25:41,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 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 05:25:41,654 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:41,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 94 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:25:41,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 05:25:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-29 05:25:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 05:25:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-11-29 05:25:41,664 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 27 [2023-11-29 05:25:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:41,664 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-11-29 05:25:41,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:25:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-11-29 05:25:41,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:25:41,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:41,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:41,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 (7)] Ended with exit code 0 [2023-11-29 05:25:41,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:41,867 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:41,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1443991612, now seen corresponding path program 1 times [2023-11-29 05:25:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284793433] [2023-11-29 05:25:41,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:41,868 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 05:25:41,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:41,869 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:41,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:42,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 05:25:42,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:42,054 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 05:25:42,122 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 05:25:42,181 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 05:25:42,181 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 05:25:42,332 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-29 05:25:42,348 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 05:25:42,349 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 53 treesize of output 46 [2023-11-29 05:25:42,398 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 28 treesize of output 20 [2023-11-29 05:25:42,454 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 35 treesize of output 19 [2023-11-29 05:25:42,457 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 05:25:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:25:42,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:42,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:25:42,547 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 31 treesize of output 32 [2023-11-29 05:25:42,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:25:42,562 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 61 treesize of output 64 [2023-11-29 05:25:42,568 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 40 treesize of output 34 [2023-11-29 05:25:42,649 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:25:42,649 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 11 treesize of output 11 [2023-11-29 05:25:42,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:42,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284793433] [2023-11-29 05:25:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284793433] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:25:42,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [558466459] [2023-11-29 05:25:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:42,788 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:25:42,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:25:42,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:25:42,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-11-29 05:25:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:43,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 05:25:43,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:43,139 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 05:25:43,394 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 05:25:43,590 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 05:25:43,591 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 05:25:43,920 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-29 05:25:43,936 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-29 05:25:43,936 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 41 treesize of output 34 [2023-11-29 05:25:44,031 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:25:44,031 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 15 treesize of output 7 [2023-11-29 05:25:44,131 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 35 treesize of output 19 [2023-11-29 05:25:44,133 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 05:25:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:25:44,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:44,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:25:44,155 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 31 treesize of output 32 [2023-11-29 05:25:44,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:25:44,170 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 61 treesize of output 64 [2023-11-29 05:25:44,176 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 40 treesize of output 34 [2023-11-29 05:25:44,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [558466459] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:25:44,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:25:44,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2023-11-29 05:25:44,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6987132] [2023-11-29 05:25:44,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:25:44,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 05:25:44,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:44,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 05:25:44,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 05:25:44,483 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:25:48,545 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 05:25:52,657 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 05:25:56,698 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 05:25:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:59,278 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-11-29 05:25:59,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:25:59,279 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-29 05:25:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:59,280 INFO L225 Difference]: With dead ends: 42 [2023-11-29 05:25:59,280 INFO L226 Difference]: Without dead ends: 39 [2023-11-29 05:25:59,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 05:25:59,281 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:59,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 334 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 486 Invalid, 3 Unknown, 0 Unchecked, 14.5s Time] [2023-11-29 05:25:59,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-29 05:25:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-11-29 05:25:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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 05:25:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-29 05:25:59,288 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2023-11-29 05:25:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:59,289 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-29 05:25:59,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-29 05:25:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-29 05:25:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 05:25:59,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:59,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:59,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:59,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-11-29 05:25:59,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:25:59,691 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:25:59,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash 151574482, now seen corresponding path program 1 times [2023-11-29 05:25:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:59,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714276600] [2023-11-29 05:25:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:25:59,692 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 05:25:59,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:59,693 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:59,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:25:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:25:59,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 05:25:59,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:59,921 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 05:25:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:25:59,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:25:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-29 05:25:59,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:25:59,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714276600] [2023-11-29 05:25:59,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714276600] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:25:59,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:25:59,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2023-11-29 05:25:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237264387] [2023-11-29 05:25:59,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:25:59,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:25:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:25:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:25:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:25:59,994 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:26:04,005 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 05:26:08,159 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 05:26:12,513 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 05:26:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:26:12,514 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-11-29 05:26:12,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:26:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-11-29 05:26:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:26:12,517 INFO L225 Difference]: With dead ends: 40 [2023-11-29 05:26:12,517 INFO L226 Difference]: Without dead ends: 31 [2023-11-29 05:26:12,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 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 05:26:12,518 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:26:12,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2023-11-29 05:26:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-29 05:26:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-11-29 05:26:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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 05:26:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-11-29 05:26:12,526 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 28 [2023-11-29 05:26:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:26:12,526 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-11-29 05:26:12,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 05:26:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-11-29 05:26:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 05:26:12,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:26:12,527 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:26:12,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:26:12,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:26:12,728 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:26:12,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:26:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1814025842, now seen corresponding path program 1 times [2023-11-29 05:26:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:26:12,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131788343] [2023-11-29 05:26:12,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:26:12,729 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 05:26:12,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:26:12,730 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:26:12,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3b6530ab-a99c-4aa8-873d-49c387ee6585/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 05:26:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:26:12,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-29 05:26:12,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:26:12,966 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 05:26:13,061 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 05:26:13,108 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 05:26:13,160 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-11-29 05:26:13,160 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 05:26:13,415 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-29 05:26:13,423 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-29 05:26:13,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:26:13,432 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 78 treesize of output 51 [2023-11-29 05:26:13,456 INFO L349 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-11-29 05:26:13,456 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 121 treesize of output 90 [2023-11-29 05:26:13,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 23 [2023-11-29 05:26:13,474 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 48 treesize of output 19 [2023-11-29 05:26:13,542 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 62 treesize of output 42 [2023-11-29 05:26:13,546 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 46 treesize of output 30 [2023-11-29 05:26:13,632 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 05:26:13,640 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 05:26:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 05:26:13,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:26:13,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:26:13,913 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 61 treesize of output 62 [2023-11-29 05:26:13,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:26:13,963 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 120 treesize of output 123 [2023-11-29 05:26:13,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:26:13,978 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 100 treesize of output 92 [2023-11-29 05:26:13,988 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 44 treesize of output 38 [2023-11-29 05:26:14,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:26:14,029 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 158 treesize of output 149 [2023-11-29 05:26:14,042 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 29 treesize of output 23 [2023-11-29 05:26:14,772 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (= .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse2 (and (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_64) .cse6))))) .cse5) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (let ((.cse15 (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632))) (or (not (= (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_64) .cse6)) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)))))))))) (.cse1 (= .cse12 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|)) (.cse0 (and (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_632 (bvadd (_ bv4 32) v_arrayElimCell_67))) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69))))))) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (let ((.cse10 (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632))) (or (not (= (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= (select (select .cse10 v_arrayElimCell_64) (bvadd (_ bv4 32) v_arrayElimCell_67)) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)))))))) (or .cse5 (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_1 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32))) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_1) (bvadd (_ bv4 32) v_arrayElimCell_67)) |c_ULTIMATE.start_main_~data~0#1|))) (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_64 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_64) (bvadd (_ bv4 32) v_arrayElimCell_67)) |c_ULTIMATE.start_main_~data~0#1|)))) .cse5))) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_66 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69)))))) (not .cse5)) (or (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse6))) .cse5) (or .cse2 .cse1) (or .cse0 .cse3) (forall ((v_ArrVal_631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_632 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_631))) (or (not (= (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_632 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) v_ArrVal_632)) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_632 .cse6)) (forall ((v_arrayElimCell_69 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_632) v_arrayElimCell_66) (bvadd (_ bv4 32) v_arrayElimCell_69))))))))))) is different from false [2023-11-29 05:26:28,744 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:26:28,744 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 11 treesize of output 11 [2023-11-29 05:26:28,766 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 05:26:28,767 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 11 treesize of output 11