./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 32caf91a957359107cc7ee97dff15a48767c1a44f043f2c3cd059b67296b8bad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:40:12,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:40:12,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 14:40:12,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:40:12,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:40:12,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:40:12,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:40:12,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:40:12,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:40:12,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:40:12,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:40:12,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:40:12,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:40:12,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:40:12,831 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:40:12,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:40:12,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:40:12,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:40:12,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:40:12,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:40:12,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:40:12,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:40:12,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:40:12,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:40:12,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:40:12,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:40:12,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:40:12,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:40:12,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:40:12,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:40:12,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:40:12,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:40:12,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:40:12,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:40:12,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:40:12,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:40:12,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:40:12,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:40:12,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:40:12,842 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32caf91a957359107cc7ee97dff15a48767c1a44f043f2c3cd059b67296b8bad [2024-10-11 14:40:13,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:40:13,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:40:13,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:40:13,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:40:13,113 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:40:13,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i [2024-10-11 14:40:14,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:40:15,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:40:15,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i [2024-10-11 14:40:15,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/44fbe0ab2/2d14902a115c493e80a41bdc281bff47/FLAG12f702310 [2024-10-11 14:40:15,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/44fbe0ab2/2d14902a115c493e80a41bdc281bff47 [2024-10-11 14:40:15,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:40:15,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:40:15,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:40:15,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:40:15,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:40:15,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:40:15" (1/1) ... [2024-10-11 14:40:15,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d3c938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:15, skipping insertion in model container [2024-10-11 14:40:15,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:40:15" (1/1) ... [2024-10-11 14:40:15,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:40:15,488 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i[4501,4514] [2024-10-11 14:40:15,497 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i[4561,4574] [2024-10-11 14:40:16,316 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,319 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,319 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,321 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,322 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,337 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,338 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,339 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,340 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,341 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,345 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,346 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,346 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,773 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,782 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:16,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:40:16,946 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:40:16,957 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i[4501,4514] [2024-10-11 14:40:16,957 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_init_dynamic_harness.i[4561,4574] [2024-10-11 14:40:17,014 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,015 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,015 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,016 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,016 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,024 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,025 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,025 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,026 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,027 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,028 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,028 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,028 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,091 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,096 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:40:17,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7529-7540] [2024-10-11 14:40:17,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:40:17,386 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:40:17,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17 WrapperNode [2024-10-11 14:40:17,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:40:17,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:40:17,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:40:17,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:40:17,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,557 INFO L138 Inliner]: procedures = 679, calls = 1552, calls flagged for inlining = 47, calls inlined = 6, statements flattened = 595 [2024-10-11 14:40:17,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:40:17,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:40:17,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:40:17,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:40:17,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,674 INFO L175 MemorySlicer]: Split 275 memory accesses to 5 slices as follows [2, 236, 5, 6, 26]. 86 percent of accesses are in the largest equivalence class. The 249 initializations are split as follows [2, 236, 5, 1, 5]. The 6 writes are split as follows [0, 0, 0, 1, 5]. [2024-10-11 14:40:17,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,675 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:40:17,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:40:17,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:40:17,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:40:17,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (1/1) ... [2024-10-11 14:40:17,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:40:17,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:17,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:40:17,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:40:17,844 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2024-10-11 14:40:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2024-10-11 14:40:17,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 14:40:17,844 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-10-11 14:40:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-10-11 14:40:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-11 14:40:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-11 14:40:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2024-10-11 14:40:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2024-10-11 14:40:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:40:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:40:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:40:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 14:40:17,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 14:40:17,846 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-10-11 14:40:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-10-11 14:40:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 14:40:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 14:40:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:40:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:40:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 14:40:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 14:40:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 14:40:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 14:40:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 14:40:17,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:40:17,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:40:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-11 14:40:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-11 14:40:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-10-11 14:40:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-10-11 14:40:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-10-11 14:40:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-10-11 14:40:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2024-10-11 14:40:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2024-10-11 14:40:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 14:40:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 14:40:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 14:40:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-11 14:40:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-11 14:40:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 14:40:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 14:40:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 14:40:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-11 14:40:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-11 14:40:17,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:40:17,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:40:17,854 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2024-10-11 14:40:17,854 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2024-10-11 14:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 14:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 14:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 14:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 14:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 14:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 14:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 14:40:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 14:40:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 14:40:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 14:40:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 14:40:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-10-11 14:40:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-10-11 14:40:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-10-11 14:40:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-10-11 14:40:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:40:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:40:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:40:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 14:40:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 14:40:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:40:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:40:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:40:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:40:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 14:40:18,135 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:40:18,138 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:40:18,841 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-11 14:40:18,842 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:40:18,936 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:40:18,938 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 14:40:18,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:40:18 BoogieIcfgContainer [2024-10-11 14:40:18,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:40:18,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:40:18,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:40:18,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:40:18,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:40:15" (1/3) ... [2024-10-11 14:40:18,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfe4833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:40:18, skipping insertion in model container [2024-10-11 14:40:18,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:40:17" (2/3) ... [2024-10-11 14:40:18,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfe4833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:40:18, skipping insertion in model container [2024-10-11 14:40:18,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:40:18" (3/3) ... [2024-10-11 14:40:18,948 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_init_dynamic_harness.i [2024-10-11 14:40:18,965 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:40:18,966 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:40:19,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:40:19,043 INFO L333 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, 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;@368afaa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:40:19,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:40:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:40:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 14:40:19,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:19,060 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-11 14:40:19,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:19,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1266245764, now seen corresponding path program 1 times [2024-10-11 14:40:19,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:19,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144698048] [2024-10-11 14:40:19,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:40:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:40:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 14:40:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:19,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:19,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144698048] [2024-10-11 14:40:19,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144698048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:19,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:19,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:40:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461073380] [2024-10-11 14:40:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:19,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:40:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:40:19,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:40:19,852 INFO L87 Difference]: Start difference. First operand has 127 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 14:40:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:20,413 INFO L93 Difference]: Finished difference Result 256 states and 358 transitions. [2024-10-11 14:40:20,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:40:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 58 [2024-10-11 14:40:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:20,429 INFO L225 Difference]: With dead ends: 256 [2024-10-11 14:40:20,429 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 14:40:20,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:40:20,437 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 80 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:20,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 151 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:40:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 14:40:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2024-10-11 14:40:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 73 states have internal predecessors, (87), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 14:40:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 157 transitions. [2024-10-11 14:40:20,510 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 157 transitions. Word has length 58 [2024-10-11 14:40:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:20,512 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 157 transitions. [2024-10-11 14:40:20,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 14:40:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 157 transitions. [2024-10-11 14:40:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 14:40:20,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:20,516 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-11 14:40:20,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:40:20,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:20,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1700219826, now seen corresponding path program 1 times [2024-10-11 14:40:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:20,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349027198] [2024-10-11 14:40:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:40:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:40:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:40:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 14:40:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:21,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:21,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349027198] [2024-10-11 14:40:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349027198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:21,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:21,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:40:21,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972649054] [2024-10-11 14:40:21,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:21,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:40:21,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:21,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:40:21,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:40:21,543 INFO L87 Difference]: Start difference. First operand 123 states and 157 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 14:40:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:22,654 INFO L93 Difference]: Finished difference Result 145 states and 183 transitions. [2024-10-11 14:40:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:40:22,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 63 [2024-10-11 14:40:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:22,658 INFO L225 Difference]: With dead ends: 145 [2024-10-11 14:40:22,658 INFO L226 Difference]: Without dead ends: 143 [2024-10-11 14:40:22,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:40:22,659 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 120 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:22,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 281 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:40:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-11 14:40:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2024-10-11 14:40:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 77 states have internal predecessors, (90), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 14:40:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions. [2024-10-11 14:40:22,695 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 63 [2024-10-11 14:40:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:22,696 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions. [2024-10-11 14:40:22,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 14:40:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2024-10-11 14:40:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 14:40:22,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:22,698 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-11 14:40:22,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:40:22,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:22,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1702066868, now seen corresponding path program 1 times [2024-10-11 14:40:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:22,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032877680] [2024-10-11 14:40:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:40:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:40:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:40:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 14:40:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032877680] [2024-10-11 14:40:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032877680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:23,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:23,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:40:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372002739] [2024-10-11 14:40:23,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:23,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:40:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:23,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:40:23,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:40:23,294 INFO L87 Difference]: Start difference. First operand 128 states and 162 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 14:40:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:24,135 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2024-10-11 14:40:24,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:40:24,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 63 [2024-10-11 14:40:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:24,138 INFO L225 Difference]: With dead ends: 251 [2024-10-11 14:40:24,138 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 14:40:24,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:40:24,140 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 111 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:24,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 244 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 14:40:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 14:40:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2024-10-11 14:40:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 78 states have internal predecessors, (91), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 14:40:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions. [2024-10-11 14:40:24,156 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 163 transitions. Word has length 63 [2024-10-11 14:40:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:24,156 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 163 transitions. [2024-10-11 14:40:24,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 14:40:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2024-10-11 14:40:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 14:40:24,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:24,159 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-10-11 14:40:24,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:40:24,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:24,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1149189064, now seen corresponding path program 1 times [2024-10-11 14:40:24,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:24,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142788751] [2024-10-11 14:40:24,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:24,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:40:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:40:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:40:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:40:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:24,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142788751] [2024-10-11 14:40:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142788751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:40:24,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67422628] [2024-10-11 14:40:24,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:24,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:24,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:24,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:40:24,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:40:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:25,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 14:40:25,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:40:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:25,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:40:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67422628] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:40:25,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:40:25,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2024-10-11 14:40:25,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219095439] [2024-10-11 14:40:25,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:40:25,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:40:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:25,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:40:25,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:40:25,406 INFO L87 Difference]: Start difference. First operand 129 states and 163 transitions. Second operand has 13 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:40:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:26,709 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions. [2024-10-11 14:40:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:40:26,710 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 64 [2024-10-11 14:40:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:26,712 INFO L225 Difference]: With dead ends: 255 [2024-10-11 14:40:26,712 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 14:40:26,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-10-11 14:40:26,718 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 160 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:26,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 478 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 14:40:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 14:40:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 132. [2024-10-11 14:40:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 78 states have (on average 1.205128205128205) internal successors, (94), 81 states have internal predecessors, (94), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 14:40:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2024-10-11 14:40:26,750 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 64 [2024-10-11 14:40:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:26,751 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2024-10-11 14:40:26,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:40:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2024-10-11 14:40:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 14:40:26,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:26,756 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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] [2024-10-11 14:40:26,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:40:26,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:26,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:26,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1427824716, now seen corresponding path program 2 times [2024-10-11 14:40:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825984287] [2024-10-11 14:40:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:40:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:40:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:40:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:40:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825984287] [2024-10-11 14:40:27,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825984287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:40:27,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610094145] [2024-10-11 14:40:27,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:40:27,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:27,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:27,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:40:27,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:40:29,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:40:29,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:40:29,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 2066 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 14:40:29,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:40:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:29,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:40:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610094145] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:40:29,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:40:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-10-11 14:40:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002143407] [2024-10-11 14:40:29,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:40:29,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 14:40:29,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:29,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 14:40:29,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:40:29,465 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 22 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:40:31,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:31,688 INFO L93 Difference]: Finished difference Result 261 states and 330 transitions. [2024-10-11 14:40:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 14:40:31,688 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 67 [2024-10-11 14:40:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:31,690 INFO L225 Difference]: With dead ends: 261 [2024-10-11 14:40:31,690 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 14:40:31,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 14:40:31,695 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 124 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:31,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 859 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 14:40:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 14:40:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2024-10-11 14:40:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 87 states have internal predecessors, (100), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 14:40:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 172 transitions. [2024-10-11 14:40:31,725 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 172 transitions. Word has length 67 [2024-10-11 14:40:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:31,727 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 172 transitions. [2024-10-11 14:40:31,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 2 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 14:40:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 172 transitions. [2024-10-11 14:40:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 14:40:31,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:31,729 INFO L215 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 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] [2024-10-11 14:40:31,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:40:31,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:31,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:31,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:31,930 INFO L85 PathProgramCache]: Analyzing trace with hash 124380980, now seen corresponding path program 3 times [2024-10-11 14:40:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:31,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121692932] [2024-10-11 14:40:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:32,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:32,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:32,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:32,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:40:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:32,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:40:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:40:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:33,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:40:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:33,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:33,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121692932] [2024-10-11 14:40:33,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121692932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:40:33,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121356486] [2024-10-11 14:40:33,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:40:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:33,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:33,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:40:33,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:40:38,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 14:40:38,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:40:38,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 2180 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 14:40:38,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:40:38,350 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 [2024-10-11 14:40:38,409 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-10-11 14:40:38,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2024-10-11 14:40:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:38,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:40:39,012 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 21 treesize of output 19 [2024-10-11 14:40:39,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2024-10-11 14:40:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:39,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121356486] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:40:39,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:40:39,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 43 [2024-10-11 14:40:39,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501306758] [2024-10-11 14:40:39,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:40:39,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 14:40:39,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:39,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 14:40:39,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1678, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 14:40:39,380 INFO L87 Difference]: Start difference. First operand 138 states and 172 transitions. Second operand has 43 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 5 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-11 14:40:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:43,502 INFO L93 Difference]: Finished difference Result 330 states and 407 transitions. [2024-10-11 14:40:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 14:40:43,502 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 5 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 73 [2024-10-11 14:40:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:43,505 INFO L225 Difference]: With dead ends: 330 [2024-10-11 14:40:43,507 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 14:40:43,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=286, Invalid=3620, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 14:40:43,509 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 309 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 3859 mSolverCounterSat, 219 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 4081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 3859 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:43,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1036 Invalid, 4081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 3859 Invalid, 3 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 14:40:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 14:40:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 203. [2024-10-11 14:40:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 131 states have internal predecessors, (151), 51 states have call successors, (51), 25 states have call predecessors, (51), 25 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 14:40:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2024-10-11 14:40:43,547 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 73 [2024-10-11 14:40:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:43,548 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2024-10-11 14:40:43,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 5 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-11 14:40:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2024-10-11 14:40:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 14:40:43,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:43,549 INFO L215 NwaCegarLoop]: trace histogram [11, 5, 5, 5, 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] [2024-10-11 14:40:43,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:40:43,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:43,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:43,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:43,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1243264914, now seen corresponding path program 1 times [2024-10-11 14:40:43,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:43,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942827321] [2024-10-11 14:40:43,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:43,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:43,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:40:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:40:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:40:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:40:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 14:40:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-11 14:40:44,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:44,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942827321] [2024-10-11 14:40:44,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942827321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:44,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:44,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:40:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595716557] [2024-10-11 14:40:44,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:44,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:40:44,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:44,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:40:44,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:40:44,157 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:40:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:44,851 INFO L93 Difference]: Finished difference Result 275 states and 340 transitions. [2024-10-11 14:40:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:40:44,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-10-11 14:40:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:44,854 INFO L225 Difference]: With dead ends: 275 [2024-10-11 14:40:44,854 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 14:40:44,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:40:44,855 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 149 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:44,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 260 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:40:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 14:40:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2024-10-11 14:40:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 129 states have (on average 1.193798449612403) internal successors, (154), 134 states have internal predecessors, (154), 51 states have call successors, (51), 25 states have call predecessors, (51), 26 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2024-10-11 14:40:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 254 transitions. [2024-10-11 14:40:44,896 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 254 transitions. Word has length 77 [2024-10-11 14:40:44,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:44,896 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 254 transitions. [2024-10-11 14:40:44,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:40:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 254 transitions. [2024-10-11 14:40:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 14:40:44,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:44,897 INFO L215 NwaCegarLoop]: trace histogram [11, 5, 5, 5, 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] [2024-10-11 14:40:44,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:40:44,898 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:44,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash 678342100, now seen corresponding path program 1 times [2024-10-11 14:40:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:44,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887142735] [2024-10-11 14:40:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:44,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:40:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:40:45,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:40:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:40:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:40:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-11 14:40:45,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:45,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887142735] [2024-10-11 14:40:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887142735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:40:45,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:40:45,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:40:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135492088] [2024-10-11 14:40:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:40:45,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:40:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:45,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:40:45,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:40:45,573 INFO L87 Difference]: Start difference. First operand 207 states and 254 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:40:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:40:46,765 INFO L93 Difference]: Finished difference Result 256 states and 316 transitions. [2024-10-11 14:40:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:40:46,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 81 [2024-10-11 14:40:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:40:46,767 INFO L225 Difference]: With dead ends: 256 [2024-10-11 14:40:46,769 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 14:40:46,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:40:46,770 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 148 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:40:46,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 365 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 14:40:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 14:40:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 214. [2024-10-11 14:40:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 133 states have (on average 1.1879699248120301) internal successors, (158), 139 states have internal predecessors, (158), 52 states have call successors, (52), 26 states have call predecessors, (52), 28 states have return successors, (52), 48 states have call predecessors, (52), 48 states have call successors, (52) [2024-10-11 14:40:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2024-10-11 14:40:46,796 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 81 [2024-10-11 14:40:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:40:46,798 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2024-10-11 14:40:46,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 14:40:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2024-10-11 14:40:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 14:40:46,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:40:46,800 INFO L215 NwaCegarLoop]: trace histogram [11, 5, 5, 5, 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] [2024-10-11 14:40:46,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:40:46,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:40:46,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:40:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2048562997, now seen corresponding path program 1 times [2024-10-11 14:40:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:40:46,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048387125] [2024-10-11 14:40:46,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:40:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:40:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:40:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:40:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:40:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:40:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:40:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:40:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:40:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:40:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:40:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 14:40:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:47,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:40:47,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048387125] [2024-10-11 14:40:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048387125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:40:47,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015199942] [2024-10-11 14:40:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:40:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:40:47,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:40:47,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:40:47,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:40:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:40:48,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-11 14:40:48,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:40:48,572 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 [2024-10-11 14:40:48,612 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 21 treesize of output 20 [2024-10-11 14:40:48,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:40:48,670 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 30 treesize of output 32 [2024-10-11 14:40:48,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:40:48,742 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 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-11 14:40:48,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:40:48,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2024-10-11 14:40:48,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:40:48,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2024-10-11 14:40:48,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:40:48,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2024-10-11 14:40:49,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:40:49,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2024-10-11 14:40:49,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:40:49,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2024-10-11 14:40:49,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:40:49,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2024-10-11 14:40:49,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:40:49,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2024-10-11 14:40:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 14:40:50,930 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:40:56,810 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 74 treesize of output 72 [2024-10-11 14:40:56,814 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 146 treesize of output 144 [2024-10-11 14:40:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 55 proven. 11 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:40:56,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015199942] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:40:56,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:40:56,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 20] total 58 [2024-10-11 14:40:56,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280513031] [2024-10-11 14:40:56,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:40:56,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-10-11 14:40:56,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:40:56,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-10-11 14:40:56,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2949, Unknown=0, NotChecked=0, Total=3306 [2024-10-11 14:40:56,970 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 58 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 53 states have internal predecessors, (104), 7 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-11 14:41:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:41:04,831 INFO L93 Difference]: Finished difference Result 508 states and 632 transitions. [2024-10-11 14:41:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-11 14:41:04,832 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 53 states have internal predecessors, (104), 7 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 81 [2024-10-11 14:41:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:41:04,834 INFO L225 Difference]: With dead ends: 508 [2024-10-11 14:41:04,835 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 14:41:04,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=859, Invalid=7883, Unknown=0, NotChecked=0, Total=8742 [2024-10-11 14:41:04,839 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 336 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 4754 mSolverCounterSat, 210 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 4754 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:41:04,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1159 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 4754 Invalid, 4 Unknown, 0 Unchecked, 5.2s Time] [2024-10-11 14:41:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 14:41:04,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 266. [2024-10-11 14:41:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 167 states have (on average 1.215568862275449) internal successors, (203), 176 states have internal predecessors, (203), 63 states have call successors, (63), 32 states have call predecessors, (63), 35 states have return successors, (62), 57 states have call predecessors, (62), 57 states have call successors, (62) [2024-10-11 14:41:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 328 transitions. [2024-10-11 14:41:04,886 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 328 transitions. Word has length 81 [2024-10-11 14:41:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:41:04,886 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 328 transitions. [2024-10-11 14:41:04,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 53 states have internal predecessors, (104), 7 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-11 14:41:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 328 transitions. [2024-10-11 14:41:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 14:41:04,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:41:04,888 INFO L215 NwaCegarLoop]: trace histogram [12, 5, 5, 5, 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] [2024-10-11 14:41:04,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 14:41:05,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 14:41:05,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:41:05,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:41:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash -582547803, now seen corresponding path program 1 times [2024-10-11 14:41:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:41:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231017151] [2024-10-11 14:41:05,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:41:05,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:41:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:05,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:41:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:41:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:05,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:41:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:05,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:41:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:05,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:41:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:05,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:41:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:41:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:41:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:05,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:41:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:41:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:41:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:41:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 14:41:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 14:41:06,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:41:06,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231017151] [2024-10-11 14:41:06,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231017151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:41:06,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909502058] [2024-10-11 14:41:06,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:41:06,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:41:06,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:41:06,380 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:41:06,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 14:41:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:06,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 2208 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-10-11 14:41:06,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:41:07,030 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 [2024-10-11 14:41:07,062 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 21 treesize of output 20 [2024-10-11 14:41:07,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,118 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 30 treesize of output 32 [2024-10-11 14:41:07,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,185 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 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-11 14:41:07,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2024-10-11 14:41:07,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2024-10-11 14:41:07,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2024-10-11 14:41:07,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2024-10-11 14:41:07,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2024-10-11 14:41:07,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2024-10-11 14:41:07,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2024-10-11 14:41:07,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:07,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 111 treesize of output 140 [2024-10-11 14:41:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 86 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 14:41:10,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:41:17,679 WARN L286 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 180 DAG size of output: 176 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-11 14:41:19,609 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 82 treesize of output 80 [2024-10-11 14:41:19,614 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 157 treesize of output 153 [2024-10-11 14:41:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 14:41:19,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909502058] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:41:19,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:41:19,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 26, 23] total 64 [2024-10-11 14:41:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90717702] [2024-10-11 14:41:19,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:41:19,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-11 14:41:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:41:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-11 14:41:19,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=3652, Unknown=0, NotChecked=0, Total=4032 [2024-10-11 14:41:19,745 INFO L87 Difference]: Start difference. First operand 266 states and 328 transitions. Second operand has 64 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 59 states have internal predecessors, (112), 7 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-11 14:41:30,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:41:30,986 INFO L93 Difference]: Finished difference Result 570 states and 714 transitions. [2024-10-11 14:41:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-11 14:41:30,986 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 59 states have internal predecessors, (112), 7 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 84 [2024-10-11 14:41:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:41:30,989 INFO L225 Difference]: With dead ends: 570 [2024-10-11 14:41:30,989 INFO L226 Difference]: Without dead ends: 340 [2024-10-11 14:41:30,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2060 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=957, Invalid=9549, Unknown=0, NotChecked=0, Total=10506 [2024-10-11 14:41:30,992 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 518 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 6248 mSolverCounterSat, 321 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 6573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 6248 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:41:30,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1233 Invalid, 6573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 6248 Invalid, 4 Unknown, 0 Unchecked, 8.2s Time] [2024-10-11 14:41:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-11 14:41:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 269. [2024-10-11 14:41:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 170 states have (on average 1.223529411764706) internal successors, (208), 179 states have internal predecessors, (208), 63 states have call successors, (63), 32 states have call predecessors, (63), 35 states have return successors, (62), 57 states have call predecessors, (62), 57 states have call successors, (62) [2024-10-11 14:41:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2024-10-11 14:41:31,041 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 84 [2024-10-11 14:41:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:41:31,041 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2024-10-11 14:41:31,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 59 states have internal predecessors, (112), 7 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2024-10-11 14:41:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2024-10-11 14:41:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 14:41:31,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:41:31,043 INFO L215 NwaCegarLoop]: trace histogram [13, 5, 5, 5, 3, 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] [2024-10-11 14:41:31,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 14:41:31,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 14:41:31,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:41:31,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:41:31,244 INFO L85 PathProgramCache]: Analyzing trace with hash -342986921, now seen corresponding path program 2 times [2024-10-11 14:41:31,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:41:31,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292849912] [2024-10-11 14:41:31,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:41:31,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:41:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:41:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:31,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:41:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:41:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:31,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:41:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:41:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:31,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:41:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:31,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:41:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:31,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 14:41:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:31,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 14:41:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:41:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:32,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:41:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:32,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:41:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:32,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 14:41:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:41:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 14:41:32,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:41:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292849912] [2024-10-11 14:41:32,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292849912] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:41:32,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686781465] [2024-10-11 14:41:32,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:41:32,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:41:32,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:41:32,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:41:32,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 14:41:33,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:41:33,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:41:33,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 2234 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-10-11 14:41:33,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:41:33,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 14:41:33,376 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 [2024-10-11 14:41:33,510 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 [2024-10-11 14:41:33,540 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 21 treesize of output 20 [2024-10-11 14:41:33,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:33,590 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 30 treesize of output 32 [2024-10-11 14:41:33,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:41:33,632 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 3 case distinctions, treesize of input 45 treesize of output 35 [2024-10-11 14:41:33,704 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2024-10-11 14:41:33,704 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 45 treesize of output 35 [2024-10-11 14:41:33,794 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2024-10-11 14:41:33,795 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 45 treesize of output 35 [2024-10-11 14:41:33,872 INFO L349 Elim1Store]: treesize reduction 73, result has 26.3 percent of original size [2024-10-11 14:41:33,873 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 47 treesize of output 35 [2024-10-11 14:41:33,936 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2024-10-11 14:41:33,937 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 45 treesize of output 35