./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:02:08,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:02:08,815 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:02:08,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:02:08,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:02:08,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:02:08,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:02:08,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:02:08,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:02:08,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:02:08,871 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:02:08,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:02:08,872 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:02:08,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:02:08,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:02:08,875 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:02:08,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:02:08,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:02:08,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:02:08,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:02:08,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:02:08,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:02:08,879 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:02:08,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:02:08,880 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:02:08,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:02:08,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:02:08,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:02:08,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:02:08,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:02:08,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:02:08,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:02:08,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:02:08,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:02:08,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:02:08,885 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:02:08,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:02:08,885 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:02:08,886 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:02:08,886 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_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/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_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 [2023-11-06 23:02:09,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:02:09,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:02:09,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:02:09,194 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:02:09,195 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:02:09,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2023-11-06 23:02:12,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:02:12,743 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:02:12,743 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2023-11-06 23:02:12,759 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/data/6d3b25917/a29997dd0f5747ddb27cc6c4e7278888/FLAG231d25add [2023-11-06 23:02:12,775 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/data/6d3b25917/a29997dd0f5747ddb27cc6c4e7278888 [2023-11-06 23:02:12,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:02:12,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:02:12,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:02:12,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:02:12,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:02:12,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:02:12" (1/1) ... [2023-11-06 23:02:12,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221fb41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:12, skipping insertion in model container [2023-11-06 23:02:12,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:02:12" (1/1) ... [2023-11-06 23:02:12,857 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:02:13,226 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_0abab8ca-993a-469f-948d-83cd7af6df8f/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2023-11-06 23:02:13,233 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_0abab8ca-993a-469f-948d-83cd7af6df8f/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2023-11-06 23:02:13,235 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_0abab8ca-993a-469f-948d-83cd7af6df8f/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2023-11-06 23:02:13,250 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:02:13,260 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:02:13,310 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_0abab8ca-993a-469f-948d-83cd7af6df8f/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2023-11-06 23:02:13,311 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_0abab8ca-993a-469f-948d-83cd7af6df8f/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2023-11-06 23:02:13,312 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_0abab8ca-993a-469f-948d-83cd7af6df8f/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2023-11-06 23:02:13,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:02:13,361 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:02:13,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13 WrapperNode [2023-11-06 23:02:13,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:02:13,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:02:13,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:02:13,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:02:13,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,426 INFO L138 Inliner]: procedures = 142, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 184 [2023-11-06 23:02:13,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:02:13,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:02:13,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:02:13,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:02:13,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:02:13,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:02:13,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:02:13,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:02:13,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (1/1) ... [2023-11-06 23:02:13,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:02:13,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:13,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:02:13,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:02:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-11-06 23:02:13,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-11-06 23:02:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2023-11-06 23:02:13,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2023-11-06 23:02:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 23:02:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:02:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 23:02:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-11-06 23:02:13,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-11-06 23:02:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 23:02:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:02:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 23:02:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:02:13,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-11-06 23:02:13,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-11-06 23:02:13,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:02:13,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:02:13,717 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:02:13,719 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:02:14,160 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:02:14,167 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:02:14,167 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 23:02:14,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:02:14 BoogieIcfgContainer [2023-11-06 23:02:14,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:02:14,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:02:14,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:02:14,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:02:14,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:02:12" (1/3) ... [2023-11-06 23:02:14,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794a2f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:02:14, skipping insertion in model container [2023-11-06 23:02:14,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:02:13" (2/3) ... [2023-11-06 23:02:14,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@794a2f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:02:14, skipping insertion in model container [2023-11-06 23:02:14,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:02:14" (3/3) ... [2023-11-06 23:02:14,179 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2023-11-06 23:02:14,208 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:02:14,208 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-06 23:02:14,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:02:14,263 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3024f2c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:02:14,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-06 23:02:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 60 states have internal predecessors, (77), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 23:02:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 23:02:14,278 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:14,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:14,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:14,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1466302514, now seen corresponding path program 1 times [2023-11-06 23:02:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947288897] [2023-11-06 23:02:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:14,455 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-06 23:02:14,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:14,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947288897] [2023-11-06 23:02:14,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947288897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:14,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:14,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:02:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174999807] [2023-11-06 23:02:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:14,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:02:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:14,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:02:14,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:02:14,498 INFO L87 Difference]: Start difference. First operand has 73 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 60 states have internal predecessors, (77), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-06 23:02:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:14,544 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2023-11-06 23:02:14,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:02:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-06 23:02:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:14,555 INFO L225 Difference]: With dead ends: 143 [2023-11-06 23:02:14,555 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 23:02:14,559 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-06 23:02:14,564 INFO L413 NwaCegarLoop]: 84 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, 84 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-06 23:02:14,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:02:14,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 23:02:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-06 23:02:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 23:02:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2023-11-06 23:02:14,631 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 13 [2023-11-06 23:02:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:14,632 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2023-11-06 23:02:14,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-06 23:02:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2023-11-06 23:02:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 23:02:14,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:14,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:14,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:02:14,635 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:14,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash -900105311, now seen corresponding path program 1 times [2023-11-06 23:02:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220183393] [2023-11-06 23:02:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:14,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:15,217 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-06 23:02:15,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220183393] [2023-11-06 23:02:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220183393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:15,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:02:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420975022] [2023-11-06 23:02:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:15,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:02:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:15,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:02:15,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:02:15,229 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-06 23:02:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:15,565 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2023-11-06 23:02:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:02:15,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-06 23:02:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:15,569 INFO L225 Difference]: With dead ends: 123 [2023-11-06 23:02:15,569 INFO L226 Difference]: Without dead ends: 117 [2023-11-06 23:02:15,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:02:15,571 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 58 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:15,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 286 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:02:15,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-06 23:02:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2023-11-06 23:02:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 23:02:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2023-11-06 23:02:15,592 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 13 [2023-11-06 23:02:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:15,592 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2023-11-06 23:02:15,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-06 23:02:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2023-11-06 23:02:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 23:02:15,594 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:15,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:15,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:02:15,595 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:15,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash -546965991, now seen corresponding path program 1 times [2023-11-06 23:02:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:15,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120894232] [2023-11-06 23:02:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:15,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 23:02:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:15,678 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-06 23:02:15,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120894232] [2023-11-06 23:02:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120894232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:15,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:15,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:02:15,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661861334] [2023-11-06 23:02:15,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:15,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:02:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:15,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:02:15,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:02:15,681 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 23:02:15,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:15,851 INFO L93 Difference]: Finished difference Result 173 states and 206 transitions. [2023-11-06 23:02:15,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:02:15,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-06 23:02:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:15,853 INFO L225 Difference]: With dead ends: 173 [2023-11-06 23:02:15,853 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 23:02:15,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-06 23:02:15,856 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 20 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:15,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 184 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:02:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 23:02:15,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2023-11-06 23:02:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 61 states have internal predecessors, (68), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-06 23:02:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2023-11-06 23:02:15,868 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 15 [2023-11-06 23:02:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:15,869 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2023-11-06 23:02:15,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 23:02:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2023-11-06 23:02:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 23:02:15,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:15,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:15,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:02:15,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:15,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1707883851, now seen corresponding path program 1 times [2023-11-06 23:02:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989128925] [2023-11-06 23:02:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 23:02:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:02:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:16,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:02:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:16,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:16,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989128925] [2023-11-06 23:02:16,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989128925] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:02:16,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092031026] [2023-11-06 23:02:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:16,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:16,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:02:16,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:02:16,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:02:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:17,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 23:02:17,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:02:17,378 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 23:02:17,379 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 23:02:17,688 INFO L322 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-11-06 23:02:17,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2023-11-06 23:02:17,722 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 7 [2023-11-06 23:02:17,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:17,795 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 8 treesize of output 1 [2023-11-06 23:02:17,824 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 7 [2023-11-06 23:02:17,892 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 7 [2023-11-06 23:02:17,938 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,947 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:17,970 INFO L322 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-11-06 23:02:17,970 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 63 [2023-11-06 23:02:17,999 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 5 treesize of output 3 [2023-11-06 23:02:18,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,073 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:18,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 81 treesize of output 55 [2023-11-06 23:02:18,096 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 5 treesize of output 3 [2023-11-06 23:02:18,643 INFO L322 Elim1Store]: treesize reduction 82, result has 37.9 percent of original size [2023-11-06 23:02:18,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 197 treesize of output 241 [2023-11-06 23:02:19,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 25 [2023-11-06 23:02:19,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 11 [2023-11-06 23:02:19,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 17 [2023-11-06 23:02:24,763 INFO L322 Elim1Store]: treesize reduction 460, result has 22.2 percent of original size [2023-11-06 23:02:24,764 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 42 case distinctions, treesize of input 4496 treesize of output 3490 [2023-11-06 23:02:25,006 INFO L322 Elim1Store]: treesize reduction 132, result has 37.1 percent of original size [2023-11-06 23:02:25,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 353 treesize of output 366 [2023-11-06 23:02:25,438 INFO L322 Elim1Store]: treesize reduction 24, result has 90.0 percent of original size [2023-11-06 23:02:25,439 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 451 treesize of output 592 [2023-11-06 23:02:25,517 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 219 treesize of output 217 [2023-11-06 23:02:25,567 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 217 treesize of output 215 [2023-11-06 23:02:25,623 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 215 treesize of output 213 [2023-11-06 23:02:25,688 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 310 treesize of output 288 [2023-11-06 23:02:25,873 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 7 treesize of output 5 [2023-11-06 23:02:26,526 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 12 treesize of output 8 [2023-11-06 23:02:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:26,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:02:26,870 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:02:26,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1158 treesize of output 1119 [2023-11-06 23:02:26,910 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 594 treesize of output 578 [2023-11-06 23:02:26,939 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 626 treesize of output 594 [2023-11-06 23:02:27,299 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:27,300 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:02:27,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:27,309 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 30 treesize of output 28 [2023-11-06 23:02:27,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:27,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:02:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:02:27,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092031026] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:02:27,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:02:27,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-06 23:02:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733159091] [2023-11-06 23:02:27,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:02:27,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 23:02:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:27,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 23:02:27,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=928, Unknown=26, NotChecked=0, Total=1056 [2023-11-06 23:02:27,550 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 33 states, 28 states have (on average 2.0) internal successors, (56), 25 states have internal predecessors, (56), 8 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-06 23:02:28,646 WARN L861 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select |c_#memory_$Pointer$.base| 4))) (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int))) (let ((.cse2 (select v_DerPreprocessor_10 0))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (and (= .cse0 (store .cse1 0 .cse2)) (= .cse1 (select (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_9) 4 v_DerPreprocessor_10) .cse2)) (not (= .cse2 4)))))) (let ((.cse4 (select .cse0 0))) (and (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse5 (store .cse3 0 .cse4))) (or (and (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int))) (and (= .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse4 (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_29) 4 v_DerPreprocessor_30) .cse4)) 4 v_DerPreprocessor_30) .cse4)) (= .cse4 (select v_DerPreprocessor_30 0)))) (exists ((v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int))) (= (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_16) 4 .cse5) .cse4) (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_2) 4 .cse5) .cse4)))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (__ldv_list_add_~next.base Int)) (let ((.cse7 (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base))) (let ((.cse6 (let ((.cse9 (store .cse7 0 .cse4))) (store (let ((.cse8 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_19) .cse4 v_DerPreprocessor_20) 4 .cse9))) (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base (select .cse8 __ldv_list_add_~next.base)) .cse4 (select .cse8 .cse4))) 4 .cse9)))) (and (= .cse3 (select .cse6 .cse4)) (= .cse5 .cse7) (not (= __ldv_list_add_~next.base 4)) (= .cse7 (select .cse6 __ldv_list_add_~next.base)) (not (= __ldv_list_add_~next.base .cse4)))))) (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (__ldv_list_add_~next.base Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base))) (let ((.cse10 (let ((.cse13 (store .cse11 0 .cse4))) (store (let ((.cse12 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_19) .cse4 v_DerPreprocessor_20) 4 .cse13))) (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base (select .cse12 __ldv_list_add_~next.base)) .cse4 (select .cse12 .cse4))) 4 .cse13)))) (and (= .cse3 (select .cse10 .cse4)) (not (= __ldv_list_add_~next.base 4)) (= .cse11 (select .cse10 __ldv_list_add_~next.base)) (not (= __ldv_list_add_~next.base .cse4)))))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (__ldv_list_add_~next.base Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse18 (store (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) 0 .cse4))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_21) .cse4 v_DerPreprocessor_22) 4 .cse18))) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) 4 .cse18)) (.cse14 (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_31) 4 v_DerPreprocessor_32)) (.cse17 (select .cse15 __ldv_list_add_~next.base))) (and (= .cse5 (select .cse14 __ldv_list_add_~next.base)) (= .cse4 (select v_DerPreprocessor_32 0)) (= (select .cse15 .cse4) (select .cse16 .cse4)) (not (= __ldv_list_add_~next.base .cse4)) (= .cse17 (select .cse16 __ldv_list_add_~next.base)) (= .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse4 (select .cse14 .cse4)) 4 v_DerPreprocessor_32) .cse4)) (= v_DerPreprocessor_21 .cse17)))))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (__ldv_list_add_~next.base Int) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse22 (store (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) 0 .cse4))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_24) .cse4 v_DerPreprocessor_25) 4 .cse22))) (let ((.cse21 (select .cse20 __ldv_list_add_~next.base)) (.cse19 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) 4 .cse22))) (and (= (select .cse19 .cse4) (select .cse20 .cse4)) (= v_DerPreprocessor_24 .cse21) (not (= __ldv_list_add_~next.base .cse4)) (= .cse21 (select .cse19 __ldv_list_add_~next.base))))))) (exists ((v_DerPreprocessor_33 (Array Int Int)) (v_DerPreprocessor_34 (Array Int Int))) (and (= .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse4 (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_33) 4 v_DerPreprocessor_34) .cse4)) 4 v_DerPreprocessor_34) .cse4)) (= .cse4 (select v_DerPreprocessor_34 0))))) (exists ((v_DerPreprocessor_18 (Array Int Int))) (= .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse4 (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_18) 4 .cse5) .cse4)) 4 .cse5) .cse4))) (and (exists ((v_DerPreprocessor_27 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int))) (and (= .cse4 (select v_DerPreprocessor_28 0)) (= .cse3 (select (store (store |c_#memory_$Pointer$.base| .cse4 (select (store (store |c_#memory_$Pointer$.base| .cse4 v_DerPreprocessor_27) 4 v_DerPreprocessor_28) .cse4)) 4 v_DerPreprocessor_28) .cse4)))) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (__ldv_list_add_~next.base Int) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse25 (store (select |c_#memory_$Pointer$.base| __ldv_list_add_~next.base) 0 .cse4))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_21) .cse4 v_DerPreprocessor_22) 4 .cse25)) (.cse24 (store (store (store |c_#memory_$Pointer$.base| __ldv_list_add_~next.base v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) 4 .cse25))) (and (not (= __ldv_list_add_~next.base 4)) (= (select .cse23 .cse4) (select .cse24 .cse4)) (not (= __ldv_list_add_~next.base .cse4)) (= (select .cse23 __ldv_list_add_~next.base) (select .cse24 __ldv_list_add_~next.base)))))))))) (not (= .cse4 4)))))) (= |c_~#drvlist~0.offset| 0) (= (select |c_#valid| 4) 1) (= |c_~#drvlist~0.base| 4) (not (= |c_ULTIMATE.start_foo_~me~0#1.base| 4))) is different from true [2023-11-06 23:02:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:33,698 INFO L93 Difference]: Finished difference Result 216 states and 254 transitions. [2023-11-06 23:02:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 23:02:33,702 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 2.0) internal successors, (56), 25 states have internal predecessors, (56), 8 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 31 [2023-11-06 23:02:33,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:33,705 INFO L225 Difference]: With dead ends: 216 [2023-11-06 23:02:33,705 INFO L226 Difference]: Without dead ends: 187 [2023-11-06 23:02:33,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=408, Invalid=2861, Unknown=41, NotChecked=112, Total=3422 [2023-11-06 23:02:33,708 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 433 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 135 mSolverCounterUnsat, 113 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 113 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:33,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1109 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1273 Invalid, 113 Unknown, 29 Unchecked, 3.3s Time] [2023-11-06 23:02:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-06 23:02:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 132. [2023-11-06 23:02:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 107 states have internal predecessors, (123), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 23:02:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2023-11-06 23:02:33,742 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 31 [2023-11-06 23:02:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:33,742 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2023-11-06 23:02:33,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 2.0) internal successors, (56), 25 states have internal predecessors, (56), 8 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-06 23:02:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2023-11-06 23:02:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 23:02:33,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:33,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:33,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:02:33,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0abab8ca-993a-469f-948d-83cd7af6df8f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:02:33,951 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:33,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1764685123, now seen corresponding path program 1 times [2023-11-06 23:02:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:33,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609303160] [2023-11-06 23:02:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:33,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:34,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 23:02:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:34,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:02:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:34,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:02:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-06 23:02:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:02:34,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:02:34,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609303160] [2023-11-06 23:02:34,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609303160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:02:34,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:02:34,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:02:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459375571] [2023-11-06 23:02:34,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:02:34,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:02:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:02:34,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:02:34,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:02:34,073 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:02:34,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:02:34,264 INFO L93 Difference]: Finished difference Result 142 states and 170 transitions. [2023-11-06 23:02:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:02:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2023-11-06 23:02:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:02:34,267 INFO L225 Difference]: With dead ends: 142 [2023-11-06 23:02:34,267 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 23:02:34,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:02:34,268 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:02:34,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 232 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:02:34,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 23:02:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-11-06 23:02:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 109 states have (on average 1.18348623853211) internal successors, (129), 113 states have internal predecessors, (129), 16 states have call successors, (16), 10 states have call predecessors, (16), 12 states have return successors, (22), 16 states have call predecessors, (22), 16 states have call successors, (22) [2023-11-06 23:02:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2023-11-06 23:02:34,297 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 33 [2023-11-06 23:02:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:02:34,297 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2023-11-06 23:02:34,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-06 23:02:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2023-11-06 23:02:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 23:02:34,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:02:34,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:02:34,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:02:34,300 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:02:34,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:02:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash -955678868, now seen corresponding path program 1 times [2023-11-06 23:02:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:02:34,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431115158] [2023-11-06 23:02:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:02:34,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:02:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:34,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-06 23:02:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:35,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 23:02:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:02:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-06 23:02:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat