./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-pthread/cs_stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-pthread/cs_stack-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:12:26,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:12:26,532 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:12:26,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:12:26,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:12:26,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:12:26,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:12:26,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:12:26,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:12:26,567 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:12:26,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:12:26,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:12:26,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:12:26,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:12:26,569 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:12:26,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:12:26,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:12:26,571 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:12:26,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:12:26,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:12:26,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:12:26,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:12:26,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:12:26,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:12:26,574 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:12:26,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:12:26,575 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:12:26,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:12:26,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:12:26,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:12:26,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:12:26,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:12:26,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:12:26,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:12:26,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:12:26,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:12:26,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:12:26,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:12:26,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:12:26,581 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:12:26,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:12:26,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:12:26,582 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_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 [2023-11-29 01:12:26,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:12:26,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:12:26,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:12:26,852 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:12:26,852 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:12:26,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/seq-pthread/cs_stack-1.i [2023-11-29 01:12:29,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:12:29,844 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:12:29,844 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2023-11-29 01:12:29,864 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/data/11d2f419d/cae72a214be34f278479f7fa0e9c957b/FLAG23a1bfb5e [2023-11-29 01:12:29,878 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/data/11d2f419d/cae72a214be34f278479f7fa0e9c957b [2023-11-29 01:12:29,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:12:29,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:12:29,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:12:29,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:12:29,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:12:29,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:12:29" (1/1) ... [2023-11-29 01:12:29,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af0e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:29, skipping insertion in model container [2023-11-29 01:12:29,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:12:29" (1/1) ... [2023-11-29 01:12:29,942 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:12:30,268 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_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/sv-benchmarks/c/seq-pthread/cs_stack-1.i[34744,34757] [2023-11-29 01:12:30,377 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:12:30,395 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:12:30,441 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_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/sv-benchmarks/c/seq-pthread/cs_stack-1.i[34744,34757] [2023-11-29 01:12:30,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:12:30,549 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:12:30,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30 WrapperNode [2023-11-29 01:12:30,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:12:30,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:12:30,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:12:30,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:12:30,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,642 INFO L138 Inliner]: procedures = 254, calls = 274, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 646 [2023-11-29 01:12:30,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:12:30,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:12:30,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:12:30,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:12:30,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,700 INFO L175 MemorySlicer]: Split 130 memory accesses to 17 slices as follows [2, 8, 8, 3, 20, 6, 12, 7, 12, 4, 5, 12, 7, 8, 13, 0, 3]. 15 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 3, 3, 0, 6, 2, 6, 0, 2, 2, 2, 0, 0, 2, 0, 0, 0]. The 38 writes are split as follows [0, 2, 2, 1, 8, 2, 3, 1, 3, 1, 1, 2, 1, 3, 7, 0, 1]. [2023-11-29 01:12:30,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,755 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:12:30,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:12:30,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:12:30,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:12:30,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (1/1) ... [2023-11-29 01:12:30,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:12:30,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:30,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:12:30,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:12:30,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:12:30,862 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:12:30,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:12:30,862 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-11-29 01:12:30,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-11-29 01:12:30,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:12:30,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:12:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:12:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 01:12:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 01:12:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 01:12:30,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 01:12:30,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 01:12:30,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 01:12:30,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-29 01:12:30,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-29 01:12:30,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-29 01:12:30,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-29 01:12:30,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-29 01:12:30,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-11-29 01:12:30,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-11-29 01:12:30,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2023-11-29 01:12:30,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:12:30,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 01:12:30,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 01:12:30,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 01:12:30,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 01:12:30,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 01:12:30,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 01:12:30,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 01:12:30,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 01:12:30,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 01:12:30,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-29 01:12:30,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-29 01:12:30,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-29 01:12:30,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-11-29 01:12:30,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-11-29 01:12:30,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-11-29 01:12:30,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-11-29 01:12:30,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2023-11-29 01:12:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-11-29 01:12:30,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-11-29 01:12:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:12:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:12:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:12:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 01:12:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 01:12:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 01:12:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 01:12:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 01:12:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 01:12:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 01:12:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 01:12:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-29 01:12:30,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-11-29 01:12:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-11-29 01:12:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-11-29 01:12:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-11-29 01:12:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2023-11-29 01:12:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:12:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:12:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:12:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 01:12:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 01:12:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 01:12:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 01:12:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 01:12:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 01:12:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-29 01:12:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-29 01:12:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-29 01:12:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-11-29 01:12:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-11-29 01:12:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-11-29 01:12:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-11-29 01:12:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2023-11-29 01:12:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2023-11-29 01:12:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2023-11-29 01:12:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:12:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:12:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:12:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:12:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 01:12:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 01:12:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 01:12:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 01:12:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 01:12:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 01:12:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-29 01:12:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-29 01:12:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-29 01:12:30,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-29 01:12:30,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-29 01:12:30,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-11-29 01:12:30,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-11-29 01:12:30,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2023-11-29 01:12:30,875 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-11-29 01:12:30,875 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-11-29 01:12:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-11-29 01:12:30,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-11-29 01:12:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-11-29 01:12:30,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-11-29 01:12:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-29 01:12:30,876 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-29 01:12:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-11-29 01:12:30,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-11-29 01:12:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:12:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:12:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:12:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 01:12:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 01:12:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 01:12:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 01:12:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 01:12:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 01:12:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 01:12:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 01:12:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-29 01:12:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-11-29 01:12:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-11-29 01:12:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-11-29 01:12:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-11-29 01:12:30,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-11-29 01:12:30,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:12:30,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:12:31,118 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:12:31,120 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:12:31,161 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,161 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2023-11-29 01:12:31,577 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,577 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##96: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2023-11-29 01:12:31,577 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,578 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-29 01:12:31,578 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,578 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-29 01:12:31,578 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,578 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-29 01:12:31,578 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2023-11-29 01:12:31,578 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2023-11-29 01:12:31,579 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2023-11-29 01:12:31,579 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2023-11-29 01:12:31,579 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,592 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,592 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-29 01:12:31,593 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-29 01:12:31,593 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,593 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,593 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: SUMMARY for call __CS_cs(); srcloc: null [2023-11-29 01:12:31,593 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-29 01:12:31,594 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-11-29 01:12:31,594 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2023-11-29 01:12:35,803 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:12:35,855 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:12:35,855 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 01:12:35,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:12:35 BoogieIcfgContainer [2023-11-29 01:12:35,855 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:12:35,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:12:35,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:12:35,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:12:35,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:12:29" (1/3) ... [2023-11-29 01:12:35,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709f8e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:12:35, skipping insertion in model container [2023-11-29 01:12:35,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:12:30" (2/3) ... [2023-11-29 01:12:35,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709f8e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:12:35, skipping insertion in model container [2023-11-29 01:12:35,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:12:35" (3/3) ... [2023-11-29 01:12:35,864 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2023-11-29 01:12:35,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:12:35,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:12:35,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:12:35,947 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;@60f8d662, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:12:35,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:12:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 128 states have (on average 1.578125) internal successors, (202), 131 states have internal predecessors, (202), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-11-29 01:12:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-29 01:12:35,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:35,979 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:12:35,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:35,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash 793737601, now seen corresponding path program 1 times [2023-11-29 01:12:35,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299579944] [2023-11-29 01:12:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 01:12:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 01:12:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 01:12:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 01:12:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-29 01:12:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-29 01:12:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 01:12:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:12:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:12:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:12:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 01:12:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 01:12:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 01:12:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 01:12:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 01:12:36,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:36,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299579944] [2023-11-29 01:12:36,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299579944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:12:36,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:12:36,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:12:36,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712242548] [2023-11-29 01:12:36,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:12:36,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:12:36,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:36,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:12:36,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:12:36,589 INFO L87 Difference]: Start difference. First operand has 212 states, 128 states have (on average 1.578125) internal successors, (202), 131 states have internal predecessors, (202), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 01:12:36,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:36,719 INFO L93 Difference]: Finished difference Result 428 states and 773 transitions. [2023-11-29 01:12:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:12:36,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2023-11-29 01:12:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:36,734 INFO L225 Difference]: With dead ends: 428 [2023-11-29 01:12:36,734 INFO L226 Difference]: Without dead ends: 215 [2023-11-29 01:12:36,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:12:36,745 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 6 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:36,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 655 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:12:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-29 01:12:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2023-11-29 01:12:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 128 states have (on average 1.515625) internal successors, (194), 130 states have internal predecessors, (194), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-11-29 01:12:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 340 transitions. [2023-11-29 01:12:36,810 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 340 transitions. Word has length 95 [2023-11-29 01:12:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:36,811 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 340 transitions. [2023-11-29 01:12:36,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 01:12:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 340 transitions. [2023-11-29 01:12:36,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 01:12:36,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:36,819 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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-29 01:12:36,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:12:36,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:36,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1233001572, now seen corresponding path program 1 times [2023-11-29 01:12:36,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508189544] [2023-11-29 01:12:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:12:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:12:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:12:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:12:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:12:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:12:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:12:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:12:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:12:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:12:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:12:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:12:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:12:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:12:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 01:12:37,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:37,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508189544] [2023-11-29 01:12:37,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508189544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:12:37,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:12:37,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:12:37,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070845288] [2023-11-29 01:12:37,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:12:37,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:12:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:37,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:12:37,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:12:37,107 INFO L87 Difference]: Start difference. First operand 211 states and 340 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 01:12:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:37,194 INFO L93 Difference]: Finished difference Result 422 states and 682 transitions. [2023-11-29 01:12:37,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:12:37,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2023-11-29 01:12:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:37,199 INFO L225 Difference]: With dead ends: 422 [2023-11-29 01:12:37,199 INFO L226 Difference]: Without dead ends: 213 [2023-11-29 01:12:37,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:12:37,202 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:37,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:12:37,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-29 01:12:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2023-11-29 01:12:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.5076923076923077) internal successors, (196), 132 states have internal predecessors, (196), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-11-29 01:12:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 342 transitions. [2023-11-29 01:12:37,232 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 342 transitions. Word has length 100 [2023-11-29 01:12:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:37,232 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 342 transitions. [2023-11-29 01:12:37,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 01:12:37,232 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 342 transitions. [2023-11-29 01:12:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-29 01:12:37,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:37,237 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 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-29 01:12:37,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:12:37,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:37,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:37,238 INFO L85 PathProgramCache]: Analyzing trace with hash -631579465, now seen corresponding path program 1 times [2023-11-29 01:12:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160451539] [2023-11-29 01:12:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-29 01:12:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 01:12:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 01:12:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 01:12:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:12:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 01:12:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 01:12:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-29 01:12:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 01:12:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 01:12:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 01:12:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 01:12:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 01:12:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 01:12:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-11-29 01:12:37,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:37,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160451539] [2023-11-29 01:12:37,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160451539] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:12:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692473600] [2023-11-29 01:12:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:37,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:37,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:37,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:37,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:12:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:12:38,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-11-29 01:12:38,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:12:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-11-29 01:12:38,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692473600] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:12:38,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:12:38,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-11-29 01:12:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952663302] [2023-11-29 01:12:38,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:12:38,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:12:38,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:38,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:12:38,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:12:38,168 INFO L87 Difference]: Start difference. First operand 213 states and 342 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 01:12:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:38,287 INFO L93 Difference]: Finished difference Result 428 states and 690 transitions. [2023-11-29 01:12:38,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:12:38,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 102 [2023-11-29 01:12:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:38,291 INFO L225 Difference]: With dead ends: 428 [2023-11-29 01:12:38,291 INFO L226 Difference]: Without dead ends: 217 [2023-11-29 01:12:38,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:12:38,295 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:38,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 979 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:12:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-11-29 01:12:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2023-11-29 01:12:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 134 states have (on average 1.492537313432836) internal successors, (200), 136 states have internal predecessors, (200), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2023-11-29 01:12:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 346 transitions. [2023-11-29 01:12:38,322 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 346 transitions. Word has length 102 [2023-11-29 01:12:38,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:38,322 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 346 transitions. [2023-11-29 01:12:38,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-11-29 01:12:38,323 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 346 transitions. [2023-11-29 01:12:38,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 01:12:38,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:38,327 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 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, 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-29 01:12:38,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:12:38,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:38,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:38,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash 903316247, now seen corresponding path program 2 times [2023-11-29 01:12:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:38,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45708284] [2023-11-29 01:12:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:38,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:12:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:12:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:12:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:12:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:12:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:12:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:12:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:12:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:12:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:12:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:12:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:12:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:12:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:12:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2023-11-29 01:12:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45708284] [2023-11-29 01:12:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45708284] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:12:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292182151] [2023-11-29 01:12:38,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:12:38,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:38,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:38,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:38,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:12:39,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 01:12:39,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:12:39,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 01:12:39,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:39,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:12:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2023-11-29 01:12:39,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:12:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292182151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:12:39,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:12:39,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2023-11-29 01:12:39,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013758235] [2023-11-29 01:12:39,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:12:39,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:12:39,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:39,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:12:39,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:12:39,666 INFO L87 Difference]: Start difference. First operand 217 states and 346 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 01:12:43,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:12:47,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:12:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:48,708 INFO L93 Difference]: Finished difference Result 804 states and 1320 transitions. [2023-11-29 01:12:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:12:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2023-11-29 01:12:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:48,717 INFO L225 Difference]: With dead ends: 804 [2023-11-29 01:12:48,717 INFO L226 Difference]: Without dead ends: 546 [2023-11-29 01:12:48,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:12:48,720 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 591 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:48,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1503 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 398 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2023-11-29 01:12:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2023-11-29 01:12:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2023-11-29 01:12:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 330 states have (on average 1.5575757575757576) internal successors, (514), 336 states have internal predecessors, (514), 188 states have call successors, (188), 27 states have call predecessors, (188), 27 states have return successors, (206), 188 states have call predecessors, (206), 188 states have call successors, (206) [2023-11-29 01:12:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 908 transitions. [2023-11-29 01:12:48,789 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 908 transitions. Word has length 106 [2023-11-29 01:12:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:48,790 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 908 transitions. [2023-11-29 01:12:48,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 01:12:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 908 transitions. [2023-11-29 01:12:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 01:12:48,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:48,798 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 3, 3, 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, 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, 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-29 01:12:48,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:12:48,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:48,999 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:49,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:49,000 INFO L85 PathProgramCache]: Analyzing trace with hash 770481507, now seen corresponding path program 1 times [2023-11-29 01:12:49,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:49,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600815663] [2023-11-29 01:12:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 01:12:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:12:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:12:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:12:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:12:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:49,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:12:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:12:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:12:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 01:12:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 01:12:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 01:12:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:12:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 01:12:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 01:12:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 01:12:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:12:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:12:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:12:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:12:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:12:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:12:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:12:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2023-11-29 01:12:49,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600815663] [2023-11-29 01:12:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600815663] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:12:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636723850] [2023-11-29 01:12:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:49,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:49,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:12:49,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:12:49,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:12:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:50,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 01:12:50,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2023-11-29 01:12:50,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:12:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2023-11-29 01:12:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636723850] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:12:50,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:12:50,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2023-11-29 01:12:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579377702] [2023-11-29 01:12:50,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:12:50,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:12:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:50,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:12:50,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:12:50,457 INFO L87 Difference]: Start difference. First operand 546 states and 908 transitions. Second operand has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 9 states have internal predecessors, (102), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2023-11-29 01:12:54,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:12:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:56,138 INFO L93 Difference]: Finished difference Result 1119 states and 1857 transitions. [2023-11-29 01:12:56,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:12:56,138 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 9 states have internal predecessors, (102), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 179 [2023-11-29 01:12:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:56,144 INFO L225 Difference]: With dead ends: 1119 [2023-11-29 01:12:56,144 INFO L226 Difference]: Without dead ends: 575 [2023-11-29 01:12:56,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 407 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2023-11-29 01:12:56,148 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 68 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 170 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:56,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1450 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 691 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2023-11-29 01:12:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2023-11-29 01:12:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 565. [2023-11-29 01:12:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 347 states have (on average 1.5360230547550433) internal successors, (533), 355 states have internal predecessors, (533), 188 states have call successors, (188), 27 states have call predecessors, (188), 29 states have return successors, (210), 188 states have call predecessors, (210), 188 states have call successors, (210) [2023-11-29 01:12:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 931 transitions. [2023-11-29 01:12:56,204 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 931 transitions. Word has length 179 [2023-11-29 01:12:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:56,204 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 931 transitions. [2023-11-29 01:12:56,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 9 states have internal predecessors, (102), 2 states have call successors, (54), 6 states have call predecessors, (54), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2023-11-29 01:12:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 931 transitions. [2023-11-29 01:12:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-29 01:12:56,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:56,210 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 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, 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, 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-29 01:12:56,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 01:12:56,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:12:56,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:12:56,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:56,411 INFO L85 PathProgramCache]: Analyzing trace with hash 35447701, now seen corresponding path program 2 times [2023-11-29 01:12:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:12:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931413955] [2023-11-29 01:12:56,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:56,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:12:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:12:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:12:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:12:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:12:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:12:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:12:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:12:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:12:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:12:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:12:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 01:12:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:12:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:12:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 01:12:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 01:12:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 01:12:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 01:12:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 01:12:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 01:12:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-29 01:12:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 01:12:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 01:12:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-29 01:12:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-11-29 01:12:57,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:12:57,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931413955] [2023-11-29 01:12:57,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931413955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:12:57,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:12:57,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:12:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595211639] [2023-11-29 01:12:57,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:12:57,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:12:57,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:12:57,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:12:57,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:12:57,554 INFO L87 Difference]: Start difference. First operand 565 states and 931 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-29 01:13:01,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:05,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:10,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:14,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:13:16,500 INFO L93 Difference]: Finished difference Result 1152 states and 1897 transitions. [2023-11-29 01:13:16,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:13:16,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 194 [2023-11-29 01:13:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:13:16,510 INFO L225 Difference]: With dead ends: 1152 [2023-11-29 01:13:16,510 INFO L226 Difference]: Without dead ends: 790 [2023-11-29 01:13:16,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:13:16,514 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 429 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 183 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:13:16,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1127 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 948 Invalid, 4 Unknown, 0 Unchecked, 18.4s Time] [2023-11-29 01:13:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2023-11-29 01:13:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 772. [2023-11-29 01:13:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 468 states have (on average 1.5299145299145298) internal successors, (716), 483 states have internal predecessors, (716), 260 states have call successors, (260), 36 states have call predecessors, (260), 43 states have return successors, (296), 260 states have call predecessors, (296), 260 states have call successors, (296) [2023-11-29 01:13:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1272 transitions. [2023-11-29 01:13:16,617 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1272 transitions. Word has length 194 [2023-11-29 01:13:16,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:13:16,617 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 1272 transitions. [2023-11-29 01:13:16,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-29 01:13:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1272 transitions. [2023-11-29 01:13:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-11-29 01:13:16,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:13:16,628 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 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, 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, 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-29 01:13:16,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:13:16,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:13:16,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:13:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash -188967617, now seen corresponding path program 1 times [2023-11-29 01:13:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:13:16,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027978842] [2023-11-29 01:13:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:16,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:13:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:13:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:13:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:13:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:13:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:13:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 01:13:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 01:13:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 01:13:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 01:13:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 01:13:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 01:13:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 01:13:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 01:13:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 01:13:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 01:13:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 01:13:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 01:13:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 01:13:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-29 01:13:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 01:13:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 01:13:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-29 01:13:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-11-29 01:13:17,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:13:17,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027978842] [2023-11-29 01:13:17,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027978842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:13:17,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:13:17,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:13:17,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284391491] [2023-11-29 01:13:17,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:13:17,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:13:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:13:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:13:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:13:17,671 INFO L87 Difference]: Start difference. First operand 772 states and 1272 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-29 01:13:21,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:25,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:29,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:33,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:13:35,274 INFO L93 Difference]: Finished difference Result 1275 states and 2071 transitions. [2023-11-29 01:13:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:13:35,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 194 [2023-11-29 01:13:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:13:35,282 INFO L225 Difference]: With dead ends: 1275 [2023-11-29 01:13:35,282 INFO L226 Difference]: Without dead ends: 748 [2023-11-29 01:13:35,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:13:35,286 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 468 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 404 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:13:35,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1235 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 893 Invalid, 3 Unknown, 0 Unchecked, 17.1s Time] [2023-11-29 01:13:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2023-11-29 01:13:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 728. [2023-11-29 01:13:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 443 states have (on average 1.512415349887133) internal successors, (670), 458 states have internal predecessors, (670), 240 states have call successors, (240), 36 states have call predecessors, (240), 44 states have return successors, (275), 240 states have call predecessors, (275), 240 states have call successors, (275) [2023-11-29 01:13:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1185 transitions. [2023-11-29 01:13:35,370 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1185 transitions. Word has length 194 [2023-11-29 01:13:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:13:35,370 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 1185 transitions. [2023-11-29 01:13:35,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2023-11-29 01:13:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1185 transitions. [2023-11-29 01:13:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-11-29 01:13:35,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:13:35,379 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:13:35,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:13:35,379 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:13:35,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:13:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1909593472, now seen corresponding path program 1 times [2023-11-29 01:13:35,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:13:35,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673840309] [2023-11-29 01:13:35,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:35,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:13:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:13:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:13:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 01:13:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 01:13:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 01:13:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:13:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:13:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 01:13:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 01:13:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:13:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:13:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 01:13:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 01:13:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 01:13:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:13:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:13:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:13:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:13:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:13:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:13:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:13:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:13:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:13:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 01:13:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2023-11-29 01:13:36,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:13:36,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673840309] [2023-11-29 01:13:36,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673840309] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:13:36,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814233240] [2023-11-29 01:13:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:36,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:13:36,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:13:36,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:13:36,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:13:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:37,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 01:13:37,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:13:37,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:13:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 280 proven. 32 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2023-11-29 01:13:37,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:13:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2023-11-29 01:13:38,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814233240] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:13:38,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:13:38,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2023-11-29 01:13:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721497106] [2023-11-29 01:13:38,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:13:38,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-29 01:13:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:13:38,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-29 01:13:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2023-11-29 01:13:38,535 INFO L87 Difference]: Start difference. First operand 728 states and 1185 transitions. Second operand has 32 states, 30 states have (on average 3.466666666666667) internal successors, (104), 28 states have internal predecessors, (104), 15 states have call successors, (53), 12 states have call predecessors, (53), 12 states have return successors, (53), 10 states have call predecessors, (53), 15 states have call successors, (53) [2023-11-29 01:13:39,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:43,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:47,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:49,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:50,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:54,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:13:58,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:02,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:06,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:10,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:14,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:18,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:22,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:26,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:29,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:33,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:37,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:14:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:14:48,982 INFO L93 Difference]: Finished difference Result 2183 states and 3500 transitions. [2023-11-29 01:14:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-11-29 01:14:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.466666666666667) internal successors, (104), 28 states have internal predecessors, (104), 15 states have call successors, (53), 12 states have call predecessors, (53), 12 states have return successors, (53), 10 states have call predecessors, (53), 15 states have call successors, (53) Word has length 197 [2023-11-29 01:14:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:14:48,995 INFO L225 Difference]: With dead ends: 2183 [2023-11-29 01:14:48,996 INFO L226 Difference]: Without dead ends: 1431 [2023-11-29 01:14:49,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2564 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1679, Invalid=6693, Unknown=0, NotChecked=0, Total=8372 [2023-11-29 01:14:49,006 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 3408 mSDsluCounter, 3178 mSDsCounter, 0 mSdLazyCounter, 4374 mSolverCounterSat, 2549 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3446 SdHoareTripleChecker+Valid, 3592 SdHoareTripleChecker+Invalid, 6936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2549 IncrementalHoareTripleChecker+Valid, 4374 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:14:49,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3446 Valid, 3592 Invalid, 6936 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2549 Valid, 4374 Invalid, 13 Unknown, 0 Unchecked, 64.9s Time] [2023-11-29 01:14:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2023-11-29 01:14:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1283. [2023-11-29 01:14:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 776 states have (on average 1.4742268041237114) internal successors, (1144), 801 states have internal predecessors, (1144), 417 states have call successors, (417), 77 states have call predecessors, (417), 89 states have return successors, (484), 415 states have call predecessors, (484), 417 states have call successors, (484) [2023-11-29 01:14:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2045 transitions. [2023-11-29 01:14:49,268 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2045 transitions. Word has length 197 [2023-11-29 01:14:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:14:49,269 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 2045 transitions. [2023-11-29 01:14:49,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.466666666666667) internal successors, (104), 28 states have internal predecessors, (104), 15 states have call successors, (53), 12 states have call predecessors, (53), 12 states have return successors, (53), 10 states have call predecessors, (53), 15 states have call successors, (53) [2023-11-29 01:14:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2045 transitions. [2023-11-29 01:14:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2023-11-29 01:14:49,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:14:49,281 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:14:49,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:14:49,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:14:49,482 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:14:49,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:14:49,483 INFO L85 PathProgramCache]: Analyzing trace with hash -722934082, now seen corresponding path program 1 times [2023-11-29 01:14:49,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:14:49,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236730528] [2023-11-29 01:14:49,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:49,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:14:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:14:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:14:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:14:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 01:14:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:14:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 01:14:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 01:14:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:14:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:14:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:14:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:14:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 01:14:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-29 01:14:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:14:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:14:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 01:14:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 01:14:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-11-29 01:14:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-29 01:14:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 01:14:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 01:14:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 01:14:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:14:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:14:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:14:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:14:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:14:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 01:14:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2023-11-29 01:14:53,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:14:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236730528] [2023-11-29 01:14:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236730528] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418265962] [2023-11-29 01:14:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:53,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:14:53,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:14:53,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:14:53,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:14:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:54,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 01:14:54,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:54,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:15:02,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:15:02,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:15:02,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2023-11-29 01:15:06,608 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2023-11-29 01:15:06,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 49 treesize of output 104 [2023-11-29 01:15:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 344 proven. 4 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2023-11-29 01:15:30,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:30,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-11-29 01:15:30,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2023-11-29 01:15:31,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-29 01:15:31,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-11-29 01:15:31,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-29 01:15:31,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-11-29 01:15:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2023-11-29 01:15:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418265962] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:15:31,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:15:31,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 9] total 40 [2023-11-29 01:15:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559151719] [2023-11-29 01:15:31,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:15:31,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-29 01:15:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:15:31,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-29 01:15:31,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1406, Unknown=5, NotChecked=0, Total=1560 [2023-11-29 01:15:31,573 INFO L87 Difference]: Start difference. First operand 1283 states and 2045 transitions. Second operand has 40 states, 37 states have (on average 3.8378378378378377) internal successors, (142), 36 states have internal predecessors, (142), 19 states have call successors, (59), 13 states have call predecessors, (59), 14 states have return successors, (59), 17 states have call predecessors, (59), 19 states have call successors, (59) [2023-11-29 01:15:35,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:15:37,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:15:41,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:15:45,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:15:48,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:15:52,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:15:54,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:15:58,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:02,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:06,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:07,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:09,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:13,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:17,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:21,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:16:22,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:23,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:27,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:29,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:31,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:35,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:16:49,415 INFO L93 Difference]: Finished difference Result 2543 states and 4104 transitions. [2023-11-29 01:16:49,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-29 01:16:49,415 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 3.8378378378378377) internal successors, (142), 36 states have internal predecessors, (142), 19 states have call successors, (59), 13 states have call predecessors, (59), 14 states have return successors, (59), 17 states have call predecessors, (59), 19 states have call successors, (59) Word has length 197 [2023-11-29 01:16:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:16:49,424 INFO L225 Difference]: With dead ends: 2543 [2023-11-29 01:16:49,424 INFO L226 Difference]: Without dead ends: 1389 [2023-11-29 01:16:49,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 425 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1506 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=968, Invalid=5189, Unknown=5, NotChecked=0, Total=6162 [2023-11-29 01:16:49,431 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 2763 mSDsluCounter, 5001 mSDsCounter, 0 mSdLazyCounter, 7520 mSolverCounterSat, 2655 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2763 SdHoareTripleChecker+Valid, 5434 SdHoareTripleChecker+Invalid, 10187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2655 IncrementalHoareTripleChecker+Valid, 7520 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:16:49,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2763 Valid, 5434 Invalid, 10187 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2655 Valid, 7520 Invalid, 12 Unknown, 0 Unchecked, 72.9s Time] [2023-11-29 01:16:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2023-11-29 01:16:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1313. [2023-11-29 01:16:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 793 states have (on average 1.4665825977301388) internal successors, (1163), 819 states have internal predecessors, (1163), 427 states have call successors, (427), 77 states have call predecessors, (427), 92 states have return successors, (519), 427 states have call predecessors, (519), 427 states have call successors, (519) [2023-11-29 01:16:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 2109 transitions. [2023-11-29 01:16:49,663 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 2109 transitions. Word has length 197 [2023-11-29 01:16:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:16:49,664 INFO L495 AbstractCegarLoop]: Abstraction has 1313 states and 2109 transitions. [2023-11-29 01:16:49,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 3.8378378378378377) internal successors, (142), 36 states have internal predecessors, (142), 19 states have call successors, (59), 13 states have call predecessors, (59), 14 states have return successors, (59), 17 states have call predecessors, (59), 19 states have call successors, (59) [2023-11-29 01:16:49,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 2109 transitions. [2023-11-29 01:16:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-11-29 01:16:49,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:16:49,674 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 10, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:16:49,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:16:49,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-29 01:16:49,874 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:16:49,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:16:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash -612587110, now seen corresponding path program 1 times [2023-11-29 01:16:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:16:49,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274211688] [2023-11-29 01:16:49,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:16:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:16:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:16:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:16:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:16:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:16:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:16:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:16:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:16:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:16:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:16:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:16:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:16:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 01:16:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:16:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:16:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:16:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:16:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:16:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:16:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 01:16:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:16:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 01:16:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:16:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 01:16:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-11-29 01:16:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 01:16:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 01:16:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 01:16:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 01:16:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 01:16:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-29 01:16:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 01:16:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-11-29 01:16:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-29 01:16:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-29 01:16:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 01:16:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-29 01:16:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1349 trivial. 0 not checked. [2023-11-29 01:16:50,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:16:50,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274211688] [2023-11-29 01:16:50,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274211688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:16:50,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:16:50,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:16:50,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193952890] [2023-11-29 01:16:50,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:16:50,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:16:50,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:16:50,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:16:50,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:16:50,778 INFO L87 Difference]: Start difference. First operand 1313 states and 2109 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-29 01:16:54,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:16:58,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:17:02,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:17:06,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:17:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:08,370 INFO L93 Difference]: Finished difference Result 2701 states and 4406 transitions. [2023-11-29 01:17:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:17:08,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 3 states have call successors, (29) Word has length 245 [2023-11-29 01:17:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:08,379 INFO L225 Difference]: With dead ends: 2701 [2023-11-29 01:17:08,379 INFO L226 Difference]: Without dead ends: 1471 [2023-11-29 01:17:08,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:17:08,384 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 58 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 81 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:08,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1249 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 665 Invalid, 4 Unknown, 0 Unchecked, 17.2s Time] [2023-11-29 01:17:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2023-11-29 01:17:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1325. [2023-11-29 01:17:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 805 states have (on average 1.4596273291925466) internal successors, (1175), 831 states have internal predecessors, (1175), 427 states have call successors, (427), 77 states have call predecessors, (427), 92 states have return successors, (519), 427 states have call predecessors, (519), 427 states have call successors, (519) [2023-11-29 01:17:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2121 transitions. [2023-11-29 01:17:08,721 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2121 transitions. Word has length 245 [2023-11-29 01:17:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:08,722 INFO L495 AbstractCegarLoop]: Abstraction has 1325 states and 2121 transitions. [2023-11-29 01:17:08,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (29), 5 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-29 01:17:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2121 transitions. [2023-11-29 01:17:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-11-29 01:17:08,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:08,736 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 10, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:08,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:17:08,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:08,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1675103360, now seen corresponding path program 1 times [2023-11-29 01:17:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:08,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943833900] [2023-11-29 01:17:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:17:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:17:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:17:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:17:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:17:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 01:17:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:17:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:17:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:17:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 01:17:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 01:17:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:17:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 01:17:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 01:17:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 01:17:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-11-29 01:17:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:17:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:17:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 01:17:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 01:17:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-29 01:17:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-11-29 01:17:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-29 01:17:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 01:17:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2023-11-29 01:17:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943833900] [2023-11-29 01:17:09,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943833900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968890266] [2023-11-29 01:17:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:09,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:09,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:09,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:09,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:17:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:10,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 1669 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 01:17:10,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:10,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:17:10,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2023-11-29 01:17:10,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:17:10,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:17:10,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-11-29 01:17:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2023-11-29 01:17:11,035 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:17:11,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968890266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:11,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:17:11,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2023-11-29 01:17:11,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428549997] [2023-11-29 01:17:11,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:11,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:17:11,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:11,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:17:11,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:17:11,038 INFO L87 Difference]: Start difference. First operand 1325 states and 2121 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2023-11-29 01:17:15,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:17:19,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:17:23,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:17:24,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:17:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:26,736 INFO L93 Difference]: Finished difference Result 1721 states and 2723 transitions. [2023-11-29 01:17:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:17:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 238 [2023-11-29 01:17:26,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:26,745 INFO L225 Difference]: With dead ends: 1721 [2023-11-29 01:17:26,745 INFO L226 Difference]: Without dead ends: 1328 [2023-11-29 01:17:26,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:17:26,747 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 457 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 347 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:26,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1412 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1207 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2023-11-29 01:17:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2023-11-29 01:17:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1307. [2023-11-29 01:17:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 792 states have (on average 1.4494949494949494) internal successors, (1148), 817 states have internal predecessors, (1148), 423 states have call successors, (423), 76 states have call predecessors, (423), 91 states have return successors, (514), 424 states have call predecessors, (514), 423 states have call successors, (514) [2023-11-29 01:17:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 2085 transitions. [2023-11-29 01:17:27,016 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 2085 transitions. Word has length 238 [2023-11-29 01:17:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:27,016 INFO L495 AbstractCegarLoop]: Abstraction has 1307 states and 2085 transitions. [2023-11-29 01:17:27,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2023-11-29 01:17:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 2085 transitions. [2023-11-29 01:17:27,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-11-29 01:17:27,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:27,027 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 10, 7, 7, 7, 7, 6, 2, 2, 2, 2, 2, 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, 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, 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, 1] [2023-11-29 01:17:27,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 01:17:27,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 01:17:27,228 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:27,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2120079398, now seen corresponding path program 1 times [2023-11-29 01:17:27,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385454343] [2023-11-29 01:17:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:17:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:17:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 01:17:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:17:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 01:17:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 01:17:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 01:17:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-29 01:17:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 01:17:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 01:17:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 01:17:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-29 01:17:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-29 01:17:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 01:17:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 01:17:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 01:17:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 01:17:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 01:17:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-11-29 01:17:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 01:17:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 01:17:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 01:17:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-29 01:17:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-29 01:17:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2023-11-29 01:17:29,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:29,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385454343] [2023-11-29 01:17:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385454343] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:29,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64239249] [2023-11-29 01:17:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:29,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:29,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:29,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:29,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 01:17:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 01:17:29,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:29,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:17:29,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:17:29,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:17:29,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:17:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 659 trivial. 0 not checked. [2023-11-29 01:17:29,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:17:29,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64239249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:29,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:17:29,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2023-11-29 01:17:29,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611775479] [2023-11-29 01:17:29,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:29,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:17:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:29,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:17:29,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:17:29,993 INFO L87 Difference]: Start difference. First operand 1307 states and 2085 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2023-11-29 01:17:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:30,742 INFO L93 Difference]: Finished difference Result 1472 states and 2326 transitions. [2023-11-29 01:17:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:17:30,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 220 [2023-11-29 01:17:30,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:30,750 INFO L225 Difference]: With dead ends: 1472 [2023-11-29 01:17:30,750 INFO L226 Difference]: Without dead ends: 1028 [2023-11-29 01:17:30,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:17:30,753 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 210 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:30,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 740 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:17:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2023-11-29 01:17:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1014. [2023-11-29 01:17:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 621 states have (on average 1.462157809983897) internal successors, (908), 640 states have internal predecessors, (908), 319 states have call successors, (319), 59 states have call predecessors, (319), 73 states have return successors, (402), 322 states have call predecessors, (402), 319 states have call successors, (402) [2023-11-29 01:17:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1629 transitions. [2023-11-29 01:17:30,968 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1629 transitions. Word has length 220 [2023-11-29 01:17:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:30,968 INFO L495 AbstractCegarLoop]: Abstraction has 1014 states and 1629 transitions. [2023-11-29 01:17:30,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2023-11-29 01:17:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1629 transitions. [2023-11-29 01:17:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-11-29 01:17:30,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:30,976 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-29 01:17:30,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 01:17:31,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 01:17:31,177 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:31,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash 295255767, now seen corresponding path program 1 times [2023-11-29 01:17:31,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:31,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856473887] [2023-11-29 01:17:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:31,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:17:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 01:17:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 01:17:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 01:17:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 01:17:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:17:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:17:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 01:17:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 01:17:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 01:17:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 01:17:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 01:17:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 01:17:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-29 01:17:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 01:17:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 01:17:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-29 01:17:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-29 01:17:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-11-29 01:17:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-11-29 01:17:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:17:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2023-11-29 01:17:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856473887] [2023-11-29 01:17:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856473887] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230307423] [2023-11-29 01:17:31,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:31,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:31,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:31,868 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:31,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 01:17:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:17:32,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2023-11-29 01:17:32,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:17:32,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230307423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:32,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:17:32,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-11-29 01:17:32,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278042372] [2023-11-29 01:17:32,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:32,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:17:32,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:32,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:17:32,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:32,626 INFO L87 Difference]: Start difference. First operand 1014 states and 1629 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-29 01:17:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:32,923 INFO L93 Difference]: Finished difference Result 1964 states and 3262 transitions. [2023-11-29 01:17:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:17:32,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 218 [2023-11-29 01:17:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:32,928 INFO L225 Difference]: With dead ends: 1964 [2023-11-29 01:17:32,928 INFO L226 Difference]: Without dead ends: 1022 [2023-11-29 01:17:32,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:32,932 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 0 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:32,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 648 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:17:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2023-11-29 01:17:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2023-11-29 01:17:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 629 states have (on average 1.4562798092209857) internal successors, (916), 648 states have internal predecessors, (916), 319 states have call successors, (319), 59 states have call predecessors, (319), 73 states have return successors, (402), 322 states have call predecessors, (402), 319 states have call successors, (402) [2023-11-29 01:17:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1637 transitions. [2023-11-29 01:17:33,125 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1637 transitions. Word has length 218 [2023-11-29 01:17:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:33,125 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 1637 transitions. [2023-11-29 01:17:33,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-29 01:17:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1637 transitions. [2023-11-29 01:17:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-11-29 01:17:33,132 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:33,133 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-29 01:17:33,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 01:17:33,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-29 01:17:33,333 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:33,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash 970415893, now seen corresponding path program 1 times [2023-11-29 01:17:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:33,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209283433] [2023-11-29 01:17:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:33,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:17:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 01:17:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 01:17:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 01:17:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 01:17:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:17:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:17:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:17:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 01:17:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 01:17:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-29 01:17:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-11-29 01:17:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-29 01:17:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 01:17:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-29 01:17:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 01:17:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 01:17:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-11-29 01:17:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-29 01:17:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-11-29 01:17:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-11-29 01:17:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 01:17:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2023-11-29 01:17:35,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209283433] [2023-11-29 01:17:35,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209283433] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153248138] [2023-11-29 01:17:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:35,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:35,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:35,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:35,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 01:17:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 01:17:36,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:36,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 01:17:45,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:17:45,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:17:45,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 48 [2023-11-29 01:17:45,499 INFO L349 Elim1Store]: treesize reduction 48, result has 63.1 percent of original size [2023-11-29 01:17:45,499 INFO L378 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 6 case distinctions, treesize of input 38 treesize of output 106 [2023-11-29 01:17:47,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 01:17:47,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 01:17:47,283 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 01:17:47,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2023-11-29 01:17:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 384 proven. 51 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-11-29 01:17:47,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:17:47,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 01:17:47,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2023-11-29 01:17:47,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-29 01:17:48,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-11-29 01:17:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2023-11-29 01:17:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153248138] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:17:48,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:17:48,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 38 [2023-11-29 01:17:48,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989877986] [2023-11-29 01:17:48,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:17:48,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 01:17:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:48,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 01:17:48,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1236, Unknown=3, NotChecked=0, Total=1406 [2023-11-29 01:17:48,232 INFO L87 Difference]: Start difference. First operand 1022 states and 1637 transitions. Second operand has 38 states, 36 states have (on average 4.0) internal successors, (144), 32 states have internal predecessors, (144), 19 states have call successors, (63), 13 states have call predecessors, (63), 14 states have return successors, (61), 16 states have call predecessors, (61), 19 states have call successors, (61) [2023-11-29 01:17:53,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:17:57,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:01,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:05,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:18:09,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:13,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:17,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:21,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:25,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:29,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:33,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:37,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:39,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:43,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:18:47,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:48,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:52,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:18:54,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:19:02,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:19:06,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:19:08,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:19:18,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 01:19:22,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:19:28,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:19:30,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 01:19:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:19:34,168 INFO L93 Difference]: Finished difference Result 2310 states and 3657 transitions. [2023-11-29 01:19:34,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-29 01:19:34,169 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 4.0) internal successors, (144), 32 states have internal predecessors, (144), 19 states have call successors, (63), 13 states have call predecessors, (63), 14 states have return successors, (61), 16 states have call predecessors, (61), 19 states have call successors, (61) Word has length 218 [2023-11-29 01:19:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:19:34,178 INFO L225 Difference]: With dead ends: 2310 [2023-11-29 01:19:34,179 INFO L226 Difference]: Without dead ends: 1322 [2023-11-29 01:19:34,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 473 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1546 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1149, Invalid=5489, Unknown=4, NotChecked=0, Total=6642 [2023-11-29 01:19:34,187 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 2889 mSDsluCounter, 4559 mSDsCounter, 0 mSdLazyCounter, 7202 mSolverCounterSat, 1985 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2903 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 9211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1985 IncrementalHoareTripleChecker+Valid, 7202 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 98.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:19:34,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2903 Valid, 5071 Invalid, 9211 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1985 Valid, 7202 Invalid, 24 Unknown, 0 Unchecked, 98.1s Time] [2023-11-29 01:19:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2023-11-29 01:19:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1254. [2023-11-29 01:19:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 770 states have (on average 1.3857142857142857) internal successors, (1067), 797 states have internal predecessors, (1067), 382 states have call successors, (382), 79 states have call predecessors, (382), 101 states have return successors, (458), 385 states have call predecessors, (458), 382 states have call successors, (458) [2023-11-29 01:19:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1907 transitions. [2023-11-29 01:19:34,487 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1907 transitions. Word has length 218 [2023-11-29 01:19:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:19:34,487 INFO L495 AbstractCegarLoop]: Abstraction has 1254 states and 1907 transitions. [2023-11-29 01:19:34,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 4.0) internal successors, (144), 32 states have internal predecessors, (144), 19 states have call successors, (63), 13 states have call predecessors, (63), 14 states have return successors, (61), 16 states have call predecessors, (61), 19 states have call successors, (61) [2023-11-29 01:19:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1907 transitions. [2023-11-29 01:19:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-29 01:19:34,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:19:34,494 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-29 01:19:34,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 01:19:34,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:19:34,694 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:19:34,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:19:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1525687925, now seen corresponding path program 1 times [2023-11-29 01:19:34,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:19:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716408316] [2023-11-29 01:19:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:19:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:36,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:19:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:19:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:36,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:19:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:36,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 01:19:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:36,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:19:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:36,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 01:19:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:36,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 01:19:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:36,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:19:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:19:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:19:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:19:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 01:19:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:19:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:19:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:19:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:19:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:19:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 01:19:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 01:19:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 01:19:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 01:19:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 01:19:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 01:19:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 01:19:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 01:19:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 01:19:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-29 01:19:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 01:19:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:19:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:19:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-29 01:19:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2023-11-29 01:19:37,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:19:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716408316] [2023-11-29 01:19:37,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716408316] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:19:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341752740] [2023-11-29 01:19:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:19:37,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:19:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:19:37,232 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:19:37,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 01:19:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:19:37,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 1824 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 01:19:38,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:19:38,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 01:19:38,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:19:38,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:19:38,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2023-11-29 01:19:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 389 proven. 63 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2023-11-29 01:19:39,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:19:39,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-11-29 01:19:39,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2023-11-29 01:19:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341752740] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:19:40,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:19:40,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 35 [2023-11-29 01:19:40,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682564369] [2023-11-29 01:19:40,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:19:40,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 01:19:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:19:40,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 01:19:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1760, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 01:19:40,938 INFO L87 Difference]: Start difference. First operand 1254 states and 1907 transitions. Second operand has 35 states, 33 states have (on average 4.0) internal successors, (132), 31 states have internal predecessors, (132), 18 states have call successors, (55), 12 states have call predecessors, (55), 14 states have return successors, (54), 17 states have call predecessors, (54), 18 states have call successors, (54) [2023-11-29 01:19:45,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:19:49,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:19:53,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:19:55,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:19:59,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:03,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:07,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:11,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:15,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:19,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:23,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:27,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:31,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:35,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:39,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:43,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:47,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:51,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:56,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:00,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:04,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:08,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:42,027 INFO L93 Difference]: Finished difference Result 3565 states and 5186 transitions. [2023-11-29 01:21:42,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2023-11-29 01:21:42,028 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 4.0) internal successors, (132), 31 states have internal predecessors, (132), 18 states have call successors, (55), 12 states have call predecessors, (55), 14 states have return successors, (54), 17 states have call predecessors, (54), 18 states have call successors, (54) Word has length 219 [2023-11-29 01:21:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:21:42,038 INFO L225 Difference]: With dead ends: 3565 [2023-11-29 01:21:42,038 INFO L226 Difference]: Without dead ends: 2279 [2023-11-29 01:21:42,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 436 SyntacticMatches, 3 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9173 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=3729, Invalid=24327, Unknown=0, NotChecked=0, Total=28056 [2023-11-29 01:21:42,052 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 3664 mSDsluCounter, 6100 mSDsCounter, 0 mSdLazyCounter, 14634 mSolverCounterSat, 3967 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3685 SdHoareTripleChecker+Valid, 6690 SdHoareTripleChecker+Invalid, 18622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3967 IncrementalHoareTripleChecker+Valid, 14634 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 104.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:21:42,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3685 Valid, 6690 Invalid, 18622 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3967 Valid, 14634 Invalid, 21 Unknown, 0 Unchecked, 104.9s Time] [2023-11-29 01:21:42,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2023-11-29 01:21:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1687. [2023-11-29 01:21:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1036 states have (on average 1.2750965250965252) internal successors, (1321), 1057 states have internal predecessors, (1321), 486 states have call successors, (486), 121 states have call predecessors, (486), 164 states have return successors, (586), 516 states have call predecessors, (586), 486 states have call successors, (586) [2023-11-29 01:21:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2393 transitions. [2023-11-29 01:21:42,467 INFO L78 Accepts]: Start accepts. Automaton has 1687 states and 2393 transitions. Word has length 219 [2023-11-29 01:21:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:21:42,468 INFO L495 AbstractCegarLoop]: Abstraction has 1687 states and 2393 transitions. [2023-11-29 01:21:42,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 4.0) internal successors, (132), 31 states have internal predecessors, (132), 18 states have call successors, (55), 12 states have call predecessors, (55), 14 states have return successors, (54), 17 states have call predecessors, (54), 18 states have call successors, (54) [2023-11-29 01:21:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2393 transitions. [2023-11-29 01:21:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-29 01:21:42,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:21:42,474 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-29 01:21:42,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 01:21:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:21:42,675 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:21:42,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash -764493778, now seen corresponding path program 1 times [2023-11-29 01:21:42,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:21:42,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069922695] [2023-11-29 01:21:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:21:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:21:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:21:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 01:21:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 01:21:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 01:21:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:21:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:21:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 01:21:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:21:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:21:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:21:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 01:21:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 01:21:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 01:21:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 01:21:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 01:21:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 01:21:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 01:21:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 01:21:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 01:21:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-29 01:21:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 01:21:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:21:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:21:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-29 01:21:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2023-11-29 01:21:44,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:21:44,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069922695] [2023-11-29 01:21:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069922695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:21:44,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:21:44,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 01:21:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560703535] [2023-11-29 01:21:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:21:44,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:21:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:21:44,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:21:44,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:21:44,528 INFO L87 Difference]: Start difference. First operand 1687 states and 2393 transitions. Second operand has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 5 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (27), 6 states have call predecessors, (27), 5 states have call successors, (27) [2023-11-29 01:21:48,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:52,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:21:56,246 INFO L93 Difference]: Finished difference Result 3821 states and 5348 transitions. [2023-11-29 01:21:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 01:21:56,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 5 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (27), 6 states have call predecessors, (27), 5 states have call successors, (27) Word has length 219 [2023-11-29 01:21:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:21:56,272 INFO L225 Difference]: With dead ends: 3821 [2023-11-29 01:21:56,273 INFO L226 Difference]: Without dead ends: 2514 [2023-11-29 01:21:56,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2023-11-29 01:21:56,278 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 782 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 881 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:21:56,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 722 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 1387 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2023-11-29 01:21:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2023-11-29 01:21:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1828. [2023-11-29 01:21:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1126 states have (on average 1.241563055062167) internal successors, (1398), 1144 states have internal predecessors, (1398), 518 states have call successors, (518), 133 states have call predecessors, (518), 183 states have return successors, (632), 558 states have call predecessors, (632), 518 states have call successors, (632) [2023-11-29 01:21:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2548 transitions. [2023-11-29 01:21:56,766 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2548 transitions. Word has length 219 [2023-11-29 01:21:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:21:56,766 INFO L495 AbstractCegarLoop]: Abstraction has 1828 states and 2548 transitions. [2023-11-29 01:21:56,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 5 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (27), 6 states have call predecessors, (27), 5 states have call successors, (27) [2023-11-29 01:21:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2548 transitions. [2023-11-29 01:21:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-29 01:21:56,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:21:56,773 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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-29 01:21:56,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:21:56,773 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:21:56,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:21:56,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1112569452, now seen corresponding path program 1 times [2023-11-29 01:21:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:21:56,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431634783] [2023-11-29 01:21:56,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:21:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:58,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 01:21:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:58,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:21:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:58,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:58,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 01:21:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 01:21:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 01:21:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:21:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:21:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 01:21:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 01:21:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 01:21:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 01:21:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 01:21:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 01:21:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 01:21:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 01:21:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-29 01:21:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-29 01:21:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-29 01:21:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 01:21:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 01:21:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-29 01:21:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-29 01:21:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 01:21:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-29 01:21:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-29 01:21:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-29 01:21:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:21:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2023-11-29 01:21:59,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:21:59,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431634783] [2023-11-29 01:21:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431634783] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:21:59,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656438523] [2023-11-29 01:21:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:21:59,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:21:59,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:21:59,277 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:21:59,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5183bbcf-d4dd-4d01-ac21-122b06e98f1f/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 01:22:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:00,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 1810 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 01:22:00,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:22:00,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 01:22:00,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:00,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2023-11-29 01:22:01,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 01:22:01,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-29 01:22:01,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:22:01,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-29 01:22:01,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-29 01:22:01,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:22:01,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-11-29 01:22:01,962 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2023-11-29 01:22:01,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-29 01:22:02,291 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2023-11-29 01:22:02,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-29 01:22:02,738 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2023-11-29 01:22:02,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-11-29 01:22:03,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:03,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 32 [2023-11-29 01:22:04,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:22:04,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 01:22:04,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:22:04,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 10 [2023-11-29 01:22:04,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-11-29 01:22:04,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-29 01:22:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 391 proven. 72 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2023-11-29 01:22:04,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:22:04,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-11-29 01:22:04,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2023-11-29 01:22:05,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-29 01:22:06,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2023-11-29 01:22:06,512 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:06,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2023-11-29 01:22:07,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 112 [2023-11-29 01:22:07,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 134 [2023-11-29 01:22:07,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-11-29 01:22:07,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2023-11-29 01:22:07,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:22:07,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2023-11-29 01:22:08,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-29 01:22:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 12 proven. 89 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2023-11-29 01:22:11,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656438523] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:22:11,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:22:11,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 34, 27] total 73 [2023-11-29 01:22:11,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159385053] [2023-11-29 01:22:11,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:22:11,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-29 01:22:11,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:22:11,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-29 01:22:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=4640, Unknown=0, NotChecked=0, Total=5256 [2023-11-29 01:22:11,281 INFO L87 Difference]: Start difference. First operand 1828 states and 2548 transitions. Second operand has 73 states, 70 states have (on average 2.742857142857143) internal successors, (192), 66 states have internal predecessors, (192), 31 states have call successors, (69), 22 states have call predecessors, (69), 26 states have return successors, (69), 30 states have call predecessors, (69), 31 states have call successors, (69) [2023-11-29 01:22:15,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:16,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:20,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:24,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:28,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:32,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:36,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:40,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:44,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:48,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:52,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:56,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:01,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:05,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:09,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:13,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:14,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:18,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:22,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:26,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:30,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:34,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:38,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:42,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:46,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:50,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:54,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:23:58,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:02,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:06,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:10,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:13,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:17,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:21,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:25,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:29,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:33,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 01:24:38,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []