./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl --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 b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:25:01,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:25:01,783 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:25:01,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:25:01,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:25:01,821 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:25:01,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:25:01,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:25:01,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:25:01,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:25:01,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:25:01,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:25:01,830 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:25:01,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:25:01,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:25:01,834 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:25:01,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:25:01,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:25:01,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:25:01,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:25:01,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:25:01,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:25:01,841 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:25:01,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:25:01,842 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:25:01,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:25:01,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:25:01,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:25:01,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:01,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:25:01,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:25:01,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:25:01,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:25:01,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:25:01,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:25:01,848 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:25:01,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:25:01,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:25:01,849 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:25:01,849 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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl 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 -> b05b18c0458ef705f828769f88cc2a590589ce4d5c3f0e48f99be90a949f7ed4 [2023-11-12 02:25:02,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:25:02,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:25:02,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:25:02,258 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:25:02,259 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:25:02,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2023-11-12 02:25:05,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:25:05,855 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:25:05,856 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i [2023-11-12 02:25:05,876 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/data/804690b46/82eae0f485364cdeb7c90ba0d60da8bb/FLAGee56894c3 [2023-11-12 02:25:05,895 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/data/804690b46/82eae0f485364cdeb7c90ba0d60da8bb [2023-11-12 02:25:05,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:25:05,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:25:05,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:05,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:25:05,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:25:05,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:05" (1/1) ... [2023-11-12 02:25:05,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f68da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:05, skipping insertion in model container [2023-11-12 02:25:05,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:05" (1/1) ... [2023-11-12 02:25:05,980 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:25:06,425 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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i[22534,22547] [2023-11-12 02:25:06,433 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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i[22606,22619] [2023-11-12 02:25:06,436 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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i[22746,22759] [2023-11-12 02:25:06,438 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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i[22820,22833] [2023-11-12 02:25:06,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:06,461 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:25:06,497 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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i[22534,22547] [2023-11-12 02:25:06,498 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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i[22606,22619] [2023-11-12 02:25:06,499 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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i[22746,22759] [2023-11-12 02:25:06,501 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_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/sv-benchmarks/c/forester-heap/sll-rb-sentinel-1.i[22820,22833] [2023-11-12 02:25:06,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:06,544 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:25:06,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06 WrapperNode [2023-11-12 02:25:06,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:06,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:06,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:25:06,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:25:06,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,640 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2023-11-12 02:25:06,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:06,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:25:06,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:25:06,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:25:06,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:25:06,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:25:06,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:25:06,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:25:06,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (1/1) ... [2023-11-12 02:25:06,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:06,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:25:06,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:25:06,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:25:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:25:06,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:25:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:25:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:25:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:25:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:25:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:25:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:25:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:25:06,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:25:06,948 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:25:06,949 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:25:07,210 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:25:07,218 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:25:07,218 INFO L302 CfgBuilder]: Removed 11 assume(true) statements. [2023-11-12 02:25:07,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:07 BoogieIcfgContainer [2023-11-12 02:25:07,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:25:07,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:25:07,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:25:07,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:25:07,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:25:05" (1/3) ... [2023-11-12 02:25:07,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a579225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:07, skipping insertion in model container [2023-11-12 02:25:07,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:06" (2/3) ... [2023-11-12 02:25:07,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a579225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:07, skipping insertion in model container [2023-11-12 02:25:07,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:07" (3/3) ... [2023-11-12 02:25:07,240 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel-1.i [2023-11-12 02:25:07,263 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:25:07,264 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-12 02:25:07,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:25:07,346 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;@7bcf728, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:25:07,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-12 02:25:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 02:25:07,360 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:07,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 02:25:07,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:25:07,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2023-11-12 02:25:07,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:07,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929041156] [2023-11-12 02:25:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:07,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929041156] [2023-11-12 02:25:07,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929041156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:07,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:07,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:25:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913450906] [2023-11-12 02:25:07,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:07,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:25:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:07,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:25:07,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:25:07,784 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:07,804 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2023-11-12 02:25:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:25:07,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 02:25:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:07,814 INFO L225 Difference]: With dead ends: 61 [2023-11-12 02:25:07,815 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 02:25:07,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:25:07,824 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:07,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:25:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 02:25:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 02:25:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-12 02:25:07,861 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2023-11-12 02:25:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:07,862 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-12 02:25:07,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-12 02:25:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 02:25:07,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:07,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:07,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:25:07,864 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:25:07,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2023-11-12 02:25:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430574193] [2023-11-12 02:25:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430574193] [2023-11-12 02:25:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430574193] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:08,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:08,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:25:08,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044828225] [2023-11-12 02:25:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:08,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:25:08,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:25:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:08,186 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:08,279 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2023-11-12 02:25:08,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:25:08,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-12 02:25:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:08,281 INFO L225 Difference]: With dead ends: 33 [2023-11-12 02:25:08,281 INFO L226 Difference]: Without dead ends: 31 [2023-11-12 02:25:08,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12 02:25:08,283 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:08,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:25:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-12 02:25:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2023-11-12 02:25:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-12 02:25:08,291 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2023-11-12 02:25:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:08,291 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-12 02:25:08,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-12 02:25:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-12 02:25:08,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:08,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:08,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:25:08,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:25:08,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2023-11-12 02:25:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:08,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222199475] [2023-11-12 02:25:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:08,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:08,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:08,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222199475] [2023-11-12 02:25:08,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222199475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:08,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:08,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:25:08,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850635223] [2023-11-12 02:25:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:08,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:25:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:08,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:25:08,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:25:08,687 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:08,932 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2023-11-12 02:25:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:25:08,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-12 02:25:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:08,935 INFO L225 Difference]: With dead ends: 57 [2023-11-12 02:25:08,935 INFO L226 Difference]: Without dead ends: 55 [2023-11-12 02:25:08,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:25:08,938 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:08,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 58 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:25:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-12 02:25:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2023-11-12 02:25:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.28125) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2023-11-12 02:25:08,954 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 10 [2023-11-12 02:25:08,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:08,955 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2023-11-12 02:25:08,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2023-11-12 02:25:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 02:25:08,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:08,957 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:08,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:25:08,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:25:08,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2023-11-12 02:25:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245412728] [2023-11-12 02:25:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245412728] [2023-11-12 02:25:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245412728] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:25:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426595011] [2023-11-12 02:25:09,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:09,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:25:09,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:25:09,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:25:09,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:25:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:09,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-12 02:25:09,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:25:09,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-12 02:25:09,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:09,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-12 02:25:10,003 INFO L351 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-12 02:25:10,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:10,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-11-12 02:25:10,106 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 02:25:10,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-12 02:25:10,154 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 02:25:10,154 INFO L351 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-12 02:25:10,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:10,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-12 02:25:10,295 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:25:10,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-11-12 02:25:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:10,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:25:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:10,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426595011] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:25:10,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:25:10,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-12 02:25:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685814493] [2023-11-12 02:25:10,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:25:10,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-12 02:25:10,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-12 02:25:10,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:25:10,544 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:10,825 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-12 02:25:10,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:25:10,826 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-12 02:25:10,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:10,827 INFO L225 Difference]: With dead ends: 42 [2023-11-12 02:25:10,827 INFO L226 Difference]: Without dead ends: 40 [2023-11-12 02:25:10,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:25:10,830 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 53 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:10,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 90 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:25:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-12 02:25:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2023-11-12 02:25:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-12 02:25:10,840 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2023-11-12 02:25:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:10,841 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-12 02:25:10,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:10,841 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-12 02:25:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 02:25:10,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:10,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:10,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:25:11,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:25:11,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:25:11,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1689639521, now seen corresponding path program 1 times [2023-11-12 02:25:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:11,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299699792] [2023-11-12 02:25:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:11,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:11,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:11,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299699792] [2023-11-12 02:25:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299699792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:11,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:11,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:25:11,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559710695] [2023-11-12 02:25:11,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:11,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:11,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:11,125 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:11,208 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-11-12 02:25:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:25:11,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-12 02:25:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:11,210 INFO L225 Difference]: With dead ends: 38 [2023-11-12 02:25:11,210 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 02:25:11,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12 02:25:11,212 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:11,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:25:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 02:25:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-11-12 02:25:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-12 02:25:11,229 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2023-11-12 02:25:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:11,230 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-12 02:25:11,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-12 02:25:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 02:25:11,231 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:11,231 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:11,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:25:11,232 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:25:11,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2084817261, now seen corresponding path program 1 times [2023-11-12 02:25:11,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:11,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568337291] [2023-11-12 02:25:11,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:11,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568337291] [2023-11-12 02:25:11,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568337291] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:25:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85511328] [2023-11-12 02:25:11,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:11,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:25:11,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:25:11,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:25:11,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:25:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:11,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-12 02:25:11,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:25:11,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2023-11-12 02:25:11,664 INFO L351 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 8 treesize of output 1 [2023-11-12 02:25:11,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2023-11-12 02:25:11,709 INFO L351 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 8 treesize of output 1 [2023-11-12 02:25:11,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2023-11-12 02:25:11,743 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2023-11-12 02:25:11,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 39 [2023-11-12 02:25:11,775 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2023-11-12 02:25:12,873 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:12,874 INFO L351 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 110 [2023-11-12 02:25:12,891 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2023-11-12 02:25:12,903 INFO L351 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 35 [2023-11-12 02:25:12,930 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:12,931 INFO L351 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 110 treesize of output 100 [2023-11-12 02:25:12,954 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-12 02:25:13,005 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-12 02:25:13,063 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:25:13,102 INFO L322 Elim1Store]: treesize reduction 26, result has 31.6 percent of original size [2023-11-12 02:25:13,102 INFO L351 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 1 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 02:25:13,162 INFO L351 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 13 treesize of output 9 [2023-11-12 02:25:13,192 INFO L351 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 13 treesize of output 9 [2023-11-12 02:25:13,216 INFO L351 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 7 [2023-11-12 02:25:13,244 INFO L351 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 7 [2023-11-12 02:25:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:13,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:25:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85511328] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:25:13,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:25:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-12 02:25:13,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900114027] [2023-11-12 02:25:13,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:25:13,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:25:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:13,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:25:13,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=67, Unknown=1, NotChecked=0, Total=90 [2023-11-12 02:25:13,420 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:13,887 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~null~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse10 (= |c_ULTIMATE.start_main_~null~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~null~0#1.base|))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse4 (select .cse5 4)) (.cse9 (not .cse10)) (.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~null~0#1.base|)) (.cse6 (not .cse2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= |c_ULTIMATE.start_main_~null~0#1.base| (select .cse0 |c_ULTIMATE.start_main_~end~0#1.offset|)) (= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) 0) (or (and .cse2 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~null~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (store (store .cse3 0 |c_ULTIMATE.start_main_~null~0#1.offset|) 4 .cse4) .cse5) (= .cse3 v_DerPreprocessor_1))))) (and .cse6 (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse7 (store (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~null~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~end~0#1.base|) 0 |c_ULTIMATE.start_main_~null~0#1.offset|) 4 (select .cse7 4)))))) (= |c_ULTIMATE.start_main_~null~0#1.base| (select .cse8 |c_ULTIMATE.start_main_~list~0#1.offset|)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select .cse7 |c_ULTIMATE.start_main_~end~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~null~0#1.offset| 0) (= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (or (and (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= (store (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~null~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~list~0#1.base|) 0 |c_ULTIMATE.start_main_~null~0#1.offset|) 4 (select .cse1 4)) .cse1)) .cse9) (and .cse10 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~null~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= .cse11 v_DerPreprocessor_1) (= (store (store .cse11 0 |c_ULTIMATE.start_main_~null~0#1.offset|) 4 .cse4) .cse5)))))) (let ((.cse12 (select .cse8 4))) (or (and .cse9 (exists ((v_arrayElimArr_7 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (and (= .cse8 (store (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~null~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~list~0#1.base|) 0 |c_ULTIMATE.start_main_~null~0#1.base|) 4 .cse12)) (= (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~null~0#1.offset|) 0)))) (and (exists ((v_arrayElimArr_5 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~null~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~null~0#1.offset|) 0) (= v_DerPreprocessor_5 .cse13) (= .cse14 (store (store .cse13 0 |c_ULTIMATE.start_main_~null~0#1.base|) 4 .cse12))))) .cse10))) (let ((.cse16 (select .cse0 4))) (or (and (exists ((v_arrayElimArr_5 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~null~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~null~0#1.offset|) 0) (= .cse14 (store (store .cse15 0 |c_ULTIMATE.start_main_~null~0#1.base|) 4 .cse16)) (= .cse15 v_DerPreprocessor_5)))) .cse2) (and (exists ((v_arrayElimArr_7 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (and (= (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~null~0#1.offset|) 0) (= (store (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~null~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~end~0#1.base|) 0 |c_ULTIMATE.start_main_~null~0#1.base|) 4 .cse16) .cse0))) .cse6)))))) is different from true [2023-11-12 02:25:13,986 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~null~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse4 (not .cse1)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= |c_ULTIMATE.start_main_~null~0#1.base| (select .cse0 |c_ULTIMATE.start_main_~end~0#1.offset|)) (or (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~null~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~end~0#1.base|))) (and (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~null~0#1.base|))) (= (store (store .cse2 0 |c_ULTIMATE.start_main_~null~0#1.offset|) 4 (select .cse3 4)) .cse3)) (= .cse2 v_DerPreprocessor_1))))) (and .cse4 (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (= .cse5 (store (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~null~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~end~0#1.base|) 0 |c_ULTIMATE.start_main_~null~0#1.offset|) 4 (select .cse5 4)))))) (= (select .cse5 |c_ULTIMATE.start_main_~end~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~null~0#1.offset| 0) (= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (let ((.cse7 (select .cse0 4))) (or (and (exists ((v_arrayElimArr_5 (Array Int Int)) (v_DerPreprocessor_5 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~null~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~null~0#1.offset|) 0) (= (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~null~0#1.base|) (store (store .cse6 0 |c_ULTIMATE.start_main_~null~0#1.base|) 4 .cse7)) (= .cse6 v_DerPreprocessor_5)))) .cse1) (and (exists ((v_arrayElimArr_7 (Array Int Int)) (v_DerPreprocessor_7 (Array Int Int))) (and (= (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~null~0#1.offset|) 0) (= (store (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~null~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~end~0#1.base|) 0 |c_ULTIMATE.start_main_~null~0#1.base|) 4 .cse7) .cse0))) .cse4)))))) is different from true [2023-11-12 02:25:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:25:14,064 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2023-11-12 02:25:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:25:14,064 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-12 02:25:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:25:14,065 INFO L225 Difference]: With dead ends: 49 [2023-11-12 02:25:14,065 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 02:25:14,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=82, Unknown=3, NotChecked=38, Total=156 [2023-11-12 02:25:14,067 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 02:25:14,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 6 Unknown, 45 Unchecked, 0.5s Time] [2023-11-12 02:25:14,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 02:25:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-12 02:25:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-12 02:25:14,084 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2023-11-12 02:25:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:25:14,084 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-12 02:25:14,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-12 02:25:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 02:25:14,086 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:25:14,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:14,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-12 02:25:14,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:25:14,296 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-12 02:25:14,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1088473273, now seen corresponding path program 1 times [2023-11-12 02:25:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:14,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347671092] [2023-11-12 02:25:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:15,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:15,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347671092] [2023-11-12 02:25:15,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347671092] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:25:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409518445] [2023-11-12 02:25:15,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:15,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:25:15,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:25:15,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:25:15,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5c8ac57-e9a6-40dc-982d-fa62ff2bd251/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:25:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:15,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-12 02:25:15,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:25:15,644 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 02:25:15,645 INFO L351 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 1 case distinctions, treesize of input 9 treesize of output 11 [2023-11-12 02:25:15,738 INFO L322 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-12 02:25:15,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-12 02:25:15,764 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 16 treesize of output 16 [2023-11-12 02:25:15,770 INFO L351 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 16 treesize of output 11 [2023-11-12 02:25:15,779 INFO L351 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 16 treesize of output 16 [2023-11-12 02:25:15,788 INFO L351 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 16 treesize of output 11 [2023-11-12 02:25:15,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:25:15,891 INFO L322 Elim1Store]: treesize reduction 33, result has 29.8 percent of original size [2023-11-12 02:25:15,891 INFO L351 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 2 case distinctions, treesize of input 73 treesize of output 61 [2023-11-12 02:25:15,913 INFO L322 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2023-11-12 02:25:15,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 23 [2023-11-12 02:25:15,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-12 02:25:15,953 INFO L322 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2023-11-12 02:25:15,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2023-11-12 02:25:16,258 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 02:25:16,349 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:25:16,349 INFO L351 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2023-11-12 02:25:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:16,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:25:16,440 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:16,442 INFO L351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2023-11-12 02:25:16,508 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:16,509 INFO L351 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 64 treesize of output 65 [2023-11-12 02:25:16,523 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:16,524 INFO L351 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 56 treesize of output 49 [2023-11-12 02:25:16,613 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:16,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1632 treesize of output 1245 [2023-11-12 02:25:16,712 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:16,713 INFO L351 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 2247 treesize of output 2166 [2023-11-12 02:25:16,960 INFO L351 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 1365 treesize of output 1343 [2023-11-12 02:25:17,081 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:17,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1376 treesize of output 1246 [2023-11-12 02:25:17,215 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:25:17,216 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 935 treesize of output 905 [2023-11-12 02:25:17,331 INFO L351 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 395 treesize of output 357