./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_byte_cursor_advance_nospec_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_nospec_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 1928632139fa770e6728c6d37f1b756676e5811f226db8d488914b16150b3c5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:51:43,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:51:43,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 12:51:43,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:51:43,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:51:43,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:51:43,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:51:43,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:51:43,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:51:43,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:51:43,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:51:43,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:51:43,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:51:43,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:51:43,572 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:51:43,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:51:43,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:51:43,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:51:43,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:51:43,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:51:43,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:51:43,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:51:43,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:51:43,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:51:43,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:51:43,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:51:43,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:51:43,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:51:43,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:51:43,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:51:43,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:51:43,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:51:43,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:51:43,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:51:43,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:51:43,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:51:43,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:51:43,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:51:43,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:51:43,582 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/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/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 -> 1928632139fa770e6728c6d37f1b756676e5811f226db8d488914b16150b3c5e [2024-10-24 12:51:43,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:51:43,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:51:43,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:51:43,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:51:43,885 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:51:43,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_nospec_harness.i [2024-10-24 12:51:45,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:51:45,723 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:51:45,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_nospec_harness.i [2024-10-24 12:51:45,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecaa1483a/5a79e644cd5c4397a127da74407994eb/FLAGf38989eb7 [2024-10-24 12:51:45,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecaa1483a/5a79e644cd5c4397a127da74407994eb [2024-10-24 12:51:45,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:51:45,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:51:45,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:51:45,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:51:45,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:51:45,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:51:45" (1/1) ... [2024-10-24 12:51:45,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44614023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:45, skipping insertion in model container [2024-10-24 12:51:45,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:51:45" (1/1) ... [2024-10-24 12:51:45,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:51:46,289 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_byte_cursor_advance_nospec_harness.i[4504,4517] [2024-10-24 12:51:46,297 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_byte_cursor_advance_nospec_harness.i[4564,4577] [2024-10-24 12:51:47,374 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,375 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,375 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,376 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,377 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,394 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,398 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,402 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,403 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,926 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,926 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:47,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:51:48,044 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:51:48,063 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_byte_cursor_advance_nospec_harness.i[4504,4517] [2024-10-24 12:51:48,063 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_byte_cursor_advance_nospec_harness.i[4564,4577] [2024-10-24 12:51:48,105 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,105 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,105 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,106 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,106 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,112 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,113 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,114 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,114 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8269] [2024-10-24 12:51:48,302 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,302 WARN L1660 CHandler]: Possible shadowing of function index [2024-10-24 12:51:48,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [8755-8766] [2024-10-24 12:51:48,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:51:48,547 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:51:48,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48 WrapperNode [2024-10-24 12:51:48,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:51:48,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:51:48,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:51:48,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:51:48,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,733 INFO L138 Inliner]: procedures = 679, calls = 2624, calls flagged for inlining = 58, calls inlined = 7, statements flattened = 951 [2024-10-24 12:51:48,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:51:48,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:51:48,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:51:48,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:51:48,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,840 INFO L175 MemorySlicer]: Split 557 memory accesses to 7 slices as follows [2, 256, 8, 238, 42, 6, 5]. 46 percent of accesses are in the largest equivalence class. The 505 initializations are split as follows [2, 256, 2, 236, 4, 0, 5]. The 11 writes are split as follows [0, 0, 0, 0, 9, 2, 0]. [2024-10-24 12:51:48,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:51:48,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:51:48,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:51:48,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:51:48,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (1/1) ... [2024-10-24 12:51:48,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:51:48,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:51:48,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:51:48,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:51:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2024-10-24 12:51:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2024-10-24 12:51:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 12:51:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-24 12:51:49,017 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-24 12:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 12:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 12:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 12:51:49,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 12:51:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 12:51:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 12:51:49,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 12:51:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 12:51:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:51:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 12:51:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 12:51:49,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:51:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-24 12:51:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2024-10-24 12:51:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:51:49,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 12:51:49,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_advance_nospec [2024-10-24 12:51:49,020 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_advance_nospec [2024-10-24 12:51:49,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 12:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 12:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 12:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 12:51:49,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 12:51:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:51:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:51:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 12:51:49,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 12:51:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 12:51:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 12:51:49,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 12:51:49,311 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:51:49,314 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:51:50,350 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2024-10-24 12:51:50,351 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:51:50,511 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:51:50,511 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 12:51:50,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:51:50 BoogieIcfgContainer [2024-10-24 12:51:50,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:51:50,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:51:50,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:51:50,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:51:50,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:51:45" (1/3) ... [2024-10-24 12:51:50,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1a0522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:51:50, skipping insertion in model container [2024-10-24 12:51:50,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:48" (2/3) ... [2024-10-24 12:51:50,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1a0522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:51:50, skipping insertion in model container [2024-10-24 12:51:50,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:51:50" (3/3) ... [2024-10-24 12:51:50,522 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_advance_nospec_harness.i [2024-10-24 12:51:50,537 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:51:50,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:51:50,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:51:50,609 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;@2e522078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:51:50,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:51:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 76 states have (on average 1.368421052631579) internal successors, (104), 77 states have internal predecessors, (104), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 12:51:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 12:51:50,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:51:50,626 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:51:50,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:51:50,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:51:50,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1244348475, now seen corresponding path program 1 times [2024-10-24 12:51:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:51:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120292971] [2024-10-24 12:51:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:51:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:51:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:51,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:51:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:51:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 12:51:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 12:51:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:51,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:51:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:51,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 12:51:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 12:51:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:51:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120292971] [2024-10-24 12:51:51,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120292971] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:51:51,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346733056] [2024-10-24 12:51:51,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:51:51,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:51:51,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:51:51,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:51:51,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 12:51:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:52,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 2470 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 12:51:52,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:51:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 12:51:52,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:51:52,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346733056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:51:52,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:51:52,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2024-10-24 12:51:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784463827] [2024-10-24 12:51:52,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:51:52,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:51:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:51:52,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:51:52,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:51:52,537 INFO L87 Difference]: Start difference. First operand has 108 states, 76 states have (on average 1.368421052631579) internal successors, (104), 77 states have internal predecessors, (104), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 12:51:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:51:52,671 INFO L93 Difference]: Finished difference Result 208 states and 306 transitions. [2024-10-24 12:51:52,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:51:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-10-24 12:51:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:51:52,687 INFO L225 Difference]: With dead ends: 208 [2024-10-24 12:51:52,687 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 12:51:52,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:51:52,697 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:51:52,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:51:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 12:51:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 12:51:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 12:51:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 138 transitions. [2024-10-24 12:51:52,743 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 138 transitions. Word has length 43 [2024-10-24 12:51:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:51:52,744 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 138 transitions. [2024-10-24 12:51:52,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 12:51:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 138 transitions. [2024-10-24 12:51:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-24 12:51:52,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:51:52,747 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:51:52,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:51:52,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-24 12:51:52,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:51:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:51:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1793387397, now seen corresponding path program 1 times [2024-10-24 12:51:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:51:52,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159410072] [2024-10-24 12:51:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:51:52,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:51:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:53,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:51:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:51:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:53,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-24 12:51:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 12:51:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:53,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 12:51:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:53,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 12:51:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 12:51:53,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:51:53,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159410072] [2024-10-24 12:51:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159410072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:51:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405840442] [2024-10-24 12:51:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:51:53,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:51:53,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:51:53,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:51:53,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:51:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:54,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 2470 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 12:51:54,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:51:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 12:51:54,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:51:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405840442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:51:54,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:51:54,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-10-24 12:51:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660741268] [2024-10-24 12:51:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:51:54,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:51:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:51:54,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:51:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:51:54,262 INFO L87 Difference]: Start difference. First operand 101 states and 138 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 12:51:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:51:54,526 INFO L93 Difference]: Finished difference Result 191 states and 266 transitions. [2024-10-24 12:51:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:51:54,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-10-24 12:51:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:51:54,530 INFO L225 Difference]: With dead ends: 191 [2024-10-24 12:51:54,531 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 12:51:54,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:51:54,532 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 19 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:51:54,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 440 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:51:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 12:51:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 12:51:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 75 states have internal predecessors, (96), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-10-24 12:51:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2024-10-24 12:51:54,551 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 43 [2024-10-24 12:51:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:51:54,552 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2024-10-24 12:51:54,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 12:51:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2024-10-24 12:51:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-24 12:51:54,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:51:54,554 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:51:54,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 12:51:54,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 12:51:54,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:51:54,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:51:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash -77400192, now seen corresponding path program 1 times [2024-10-24 12:51:54,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:51:54,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391650735] [2024-10-24 12:51:54,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:51:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:51:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:55,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:51:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:51:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 12:51:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:55,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:51:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:55,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 12:51:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:55,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 12:51:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 12:51:55,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:51:55,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391650735] [2024-10-24 12:51:55,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391650735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:51:55,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510859408] [2024-10-24 12:51:55,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:51:55,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:51:55,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:51:55,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:51:55,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 12:51:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:55,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:51:55,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:51:55,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 12:51:55,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:51:55,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510859408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:51:55,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:51:55,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-10-24 12:51:55,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449291931] [2024-10-24 12:51:55,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:51:55,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:51:55,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:51:55,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:51:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:51:55,997 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 12:51:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:51:56,336 INFO L93 Difference]: Finished difference Result 184 states and 256 transitions. [2024-10-24 12:51:56,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:51:56,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2024-10-24 12:51:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:51:56,338 INFO L225 Difference]: With dead ends: 184 [2024-10-24 12:51:56,339 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 12:51:56,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:51:56,340 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:51:56,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 453 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:51:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 12:51:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 12:51:56,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 75 states have internal predecessors, (96), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-24 12:51:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-10-24 12:51:56,354 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 45 [2024-10-24 12:51:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:51:56,354 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-10-24 12:51:56,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 12:51:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-10-24 12:51:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 12:51:56,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:51:56,358 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:51:56,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 12:51:56,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:51:56,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:51:56,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:51:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash -305205728, now seen corresponding path program 1 times [2024-10-24 12:51:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:51:56,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275394610] [2024-10-24 12:51:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:51:56,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:51:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:51:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:57,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:51:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:57,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 12:51:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:57,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:51:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:57,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 12:51:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:57,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:51:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:51:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 12:51:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:51:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275394610] [2024-10-24 12:51:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275394610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:51:57,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:51:57,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:51:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035532317] [2024-10-24 12:51:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:51:57,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:51:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:51:57,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:51:57,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:51:57,607 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 12:51:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:51:57,963 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2024-10-24 12:51:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 12:51:57,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 49 [2024-10-24 12:51:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:51:57,965 INFO L225 Difference]: With dead ends: 114 [2024-10-24 12:51:57,965 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 12:51:57,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:51:57,968 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:51:57,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 879 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:51:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 12:51:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-24 12:51:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 81 states have internal predecessors, (101), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2024-10-24 12:51:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 153 transitions. [2024-10-24 12:51:57,997 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 153 transitions. Word has length 49 [2024-10-24 12:51:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:51:57,997 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 153 transitions. [2024-10-24 12:51:57,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 12:51:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 153 transitions. [2024-10-24 12:51:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 12:51:57,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:51:57,999 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:51:57,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:51:57,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:51:58,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:51:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1368767400, now seen corresponding path program 1 times [2024-10-24 12:51:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:51:58,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502566511] [2024-10-24 12:51:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:51:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:51:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:52:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:01,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 12:52:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:01,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:52:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 12:52:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:01,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:52:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 12:52:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502566511] [2024-10-24 12:52:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502566511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280890861] [2024-10-24 12:52:01,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:01,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:01,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:01,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:52:01,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 12:52:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:02,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-24 12:52:02,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:02,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 12:52:02,206 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 8 treesize of output 1 [2024-10-24 12:52:02,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:52:02,787 INFO L349 Elim1Store]: treesize reduction 92, result has 22.7 percent of original size [2024-10-24 12:52:02,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 39 [2024-10-24 12:52:02,829 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-10-24 12:52:02,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2024-10-24 12:52:02,894 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-10-24 12:52:02,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2024-10-24 12:52:03,335 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-24 12:52:03,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-24 12:52:03,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-24 12:52:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:52:03,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:52:04,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280890861] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:04,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:52:04,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2024-10-24 12:52:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669852621] [2024-10-24 12:52:04,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:52:04,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-24 12:52:04,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:04,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-24 12:52:04,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1467, Unknown=11, NotChecked=0, Total=1640 [2024-10-24 12:52:04,133 INFO L87 Difference]: Start difference. First operand 111 states and 153 transitions. Second operand has 35 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 31 states have internal predecessors, (68), 11 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-24 12:52:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:06,991 INFO L93 Difference]: Finished difference Result 378 states and 525 transitions. [2024-10-24 12:52:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-24 12:52:06,992 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 31 states have internal predecessors, (68), 11 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) Word has length 53 [2024-10-24 12:52:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:06,995 INFO L225 Difference]: With dead ends: 378 [2024-10-24 12:52:06,995 INFO L226 Difference]: Without dead ends: 281 [2024-10-24 12:52:06,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=3242, Unknown=12, NotChecked=0, Total=3660 [2024-10-24 12:52:06,998 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 512 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:06,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1463 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 12:52:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-24 12:52:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 199. [2024-10-24 12:52:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.289855072463768) internal successors, (178), 144 states have internal predecessors, (178), 43 states have call successors, (43), 17 states have call predecessors, (43), 17 states have return successors, (46), 37 states have call predecessors, (46), 37 states have call successors, (46) [2024-10-24 12:52:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 267 transitions. [2024-10-24 12:52:07,027 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 267 transitions. Word has length 53 [2024-10-24 12:52:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:07,027 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 267 transitions. [2024-10-24 12:52:07,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 31 states have internal predecessors, (68), 11 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12) [2024-10-24 12:52:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 267 transitions. [2024-10-24 12:52:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 12:52:07,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:07,030 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:07,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 12:52:07,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:07,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:07,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1398845517, now seen corresponding path program 1 times [2024-10-24 12:52:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638718791] [2024-10-24 12:52:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:09,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:09,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:52:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 12:52:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:09,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:52:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:09,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 12:52:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:09,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:52:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 12:52:09,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:09,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638718791] [2024-10-24 12:52:09,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638718791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:09,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:52:09,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 12:52:09,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531787374] [2024-10-24 12:52:09,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:09,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 12:52:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:09,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 12:52:09,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:52:09,686 INFO L87 Difference]: Start difference. First operand 199 states and 267 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 12:52:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:10,810 INFO L93 Difference]: Finished difference Result 316 states and 429 transitions. [2024-10-24 12:52:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 12:52:10,811 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2024-10-24 12:52:10,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:10,814 INFO L225 Difference]: With dead ends: 316 [2024-10-24 12:52:10,814 INFO L226 Difference]: Without dead ends: 240 [2024-10-24 12:52:10,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2024-10-24 12:52:10,815 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 215 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:10,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 992 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 12:52:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-24 12:52:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 213. [2024-10-24 12:52:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 158 states have internal predecessors, (195), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (47), 37 states have call predecessors, (47), 38 states have call successors, (47) [2024-10-24 12:52:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 286 transitions. [2024-10-24 12:52:10,843 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 286 transitions. Word has length 65 [2024-10-24 12:52:10,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:10,845 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 286 transitions. [2024-10-24 12:52:10,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 12:52:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 286 transitions. [2024-10-24 12:52:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 12:52:10,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:10,847 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:10,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:52:10,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:10,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1001267760, now seen corresponding path program 1 times [2024-10-24 12:52:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:10,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638034192] [2024-10-24 12:52:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:10,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:12,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:52:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 12:52:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:52:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 12:52:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:12,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 12:52:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:12,775 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 12:52:12,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638034192] [2024-10-24 12:52:12,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638034192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751329430] [2024-10-24 12:52:12,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:12,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:12,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:12,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:52:12,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 12:52:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:13,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 2604 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-24 12:52:13,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:14,066 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 17 treesize of output 9 [2024-10-24 12:52:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:52:14,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:52:14,610 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 12:52:14,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2024-10-24 12:52:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 12:52:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751329430] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:52:14,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:52:14,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 25 [2024-10-24 12:52:14,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651698015] [2024-10-24 12:52:14,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:52:14,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 12:52:14,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:14,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 12:52:14,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-10-24 12:52:14,627 INFO L87 Difference]: Start difference. First operand 213 states and 286 transitions. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 23 states have internal predecessors, (93), 6 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-24 12:52:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:16,929 INFO L93 Difference]: Finished difference Result 588 states and 805 transitions. [2024-10-24 12:52:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-24 12:52:16,930 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 23 states have internal predecessors, (93), 6 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 66 [2024-10-24 12:52:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:16,934 INFO L225 Difference]: With dead ends: 588 [2024-10-24 12:52:16,934 INFO L226 Difference]: Without dead ends: 412 [2024-10-24 12:52:16,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 124 SyntacticMatches, 9 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=316, Invalid=1940, Unknown=0, NotChecked=0, Total=2256 [2024-10-24 12:52:16,937 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 285 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:16,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1407 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 12:52:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-24 12:52:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 288. [2024-10-24 12:52:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 213 states have (on average 1.3098591549295775) internal successors, (279), 220 states have internal predecessors, (279), 53 states have call successors, (53), 22 states have call predecessors, (53), 21 states have return successors, (59), 45 states have call predecessors, (59), 47 states have call successors, (59) [2024-10-24 12:52:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 391 transitions. [2024-10-24 12:52:16,978 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 391 transitions. Word has length 66 [2024-10-24 12:52:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:16,978 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 391 transitions. [2024-10-24 12:52:16,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 23 states have internal predecessors, (93), 6 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-10-24 12:52:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 391 transitions. [2024-10-24 12:52:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 12:52:16,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:16,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:16,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 12:52:17,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:17,181 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:17,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1325240430, now seen corresponding path program 1 times [2024-10-24 12:52:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:17,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720495441] [2024-10-24 12:52:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:52:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 12:52:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 12:52:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 12:52:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 12:52:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 12:52:18,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720495441] [2024-10-24 12:52:18,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720495441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:18,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343796246] [2024-10-24 12:52:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:18,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:18,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:18,181 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:52:18,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 12:52:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:18,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 2506 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 12:52:18,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 12:52:18,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:52:18,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343796246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:18,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:52:18,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2024-10-24 12:52:18,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524993797] [2024-10-24 12:52:18,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:18,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:52:18,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:52:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:52:18,682 INFO L87 Difference]: Start difference. First operand 288 states and 391 transitions. Second operand has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 12:52:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:18,956 INFO L93 Difference]: Finished difference Result 495 states and 674 transitions. [2024-10-24 12:52:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:52:18,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2024-10-24 12:52:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:18,959 INFO L225 Difference]: With dead ends: 495 [2024-10-24 12:52:18,959 INFO L226 Difference]: Without dead ends: 304 [2024-10-24 12:52:18,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:52:18,961 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:18,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 997 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 12:52:18,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-24 12:52:18,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2024-10-24 12:52:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 216 states have (on average 1.3055555555555556) internal successors, (282), 224 states have internal predecessors, (282), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2024-10-24 12:52:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 397 transitions. [2024-10-24 12:52:18,987 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 397 transitions. Word has length 57 [2024-10-24 12:52:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:18,987 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 397 transitions. [2024-10-24 12:52:18,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 12:52:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 397 transitions. [2024-10-24 12:52:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 12:52:18,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:18,989 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:19,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 12:52:19,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:19,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:19,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash -380724064, now seen corresponding path program 1 times [2024-10-24 12:52:19,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:19,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975314754] [2024-10-24 12:52:19,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:19,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:19,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:52:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:19,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 12:52:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:52:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:19,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 12:52:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:19,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 12:52:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:19,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 12:52:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:19,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 12:52:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-24 12:52:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975314754] [2024-10-24 12:52:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975314754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:52:19,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:52:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016659125] [2024-10-24 12:52:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:52:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:52:19,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:52:19,560 INFO L87 Difference]: Start difference. First operand 292 states and 397 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 12:52:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:19,713 INFO L93 Difference]: Finished difference Result 392 states and 528 transitions. [2024-10-24 12:52:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:52:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-10-24 12:52:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:19,716 INFO L225 Difference]: With dead ends: 392 [2024-10-24 12:52:19,717 INFO L226 Difference]: Without dead ends: 292 [2024-10-24 12:52:19,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:52:19,719 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 38 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:19,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 323 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:52:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-24 12:52:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2024-10-24 12:52:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 222 states have internal predecessors, (279), 53 states have call successors, (53), 22 states have call predecessors, (53), 21 states have return successors, (61), 45 states have call predecessors, (61), 47 states have call successors, (61) [2024-10-24 12:52:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 393 transitions. [2024-10-24 12:52:19,752 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 393 transitions. Word has length 60 [2024-10-24 12:52:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:19,753 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 393 transitions. [2024-10-24 12:52:19,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 12:52:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 393 transitions. [2024-10-24 12:52:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 12:52:19,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:19,755 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:52:19,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:52:19,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:19,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:19,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1422006635, now seen corresponding path program 1 times [2024-10-24 12:52:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:19,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966278280] [2024-10-24 12:52:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:21,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 12:52:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 12:52:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:21,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:52:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 12:52:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:52:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 12:52:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966278280] [2024-10-24 12:52:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966278280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099697736] [2024-10-24 12:52:21,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:21,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:21,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:52:21,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 12:52:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:22,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 2516 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 12:52:22,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:22,327 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-24 12:52:22,330 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-24 12:52:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 12:52:22,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:52:22,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099697736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:22,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:52:22,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2024-10-24 12:52:22,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10981197] [2024-10-24 12:52:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:22,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:52:22,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:52:22,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2024-10-24 12:52:22,735 INFO L87 Difference]: Start difference. First operand 290 states and 393 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 12:52:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:24,248 INFO L93 Difference]: Finished difference Result 718 states and 963 transitions. [2024-10-24 12:52:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:52:24,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2024-10-24 12:52:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:24,252 INFO L225 Difference]: With dead ends: 718 [2024-10-24 12:52:24,252 INFO L226 Difference]: Without dead ends: 527 [2024-10-24 12:52:24,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2024-10-24 12:52:24,254 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 149 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:24,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 796 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 12:52:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-24 12:52:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 358. [2024-10-24 12:52:24,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 265 states have (on average 1.2867924528301886) internal successors, (341), 274 states have internal predecessors, (341), 62 states have call successors, (62), 29 states have call predecessors, (62), 30 states have return successors, (76), 54 states have call predecessors, (76), 56 states have call successors, (76) [2024-10-24 12:52:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 479 transitions. [2024-10-24 12:52:24,297 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 479 transitions. Word has length 59 [2024-10-24 12:52:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:24,297 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 479 transitions. [2024-10-24 12:52:24,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 12:52:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 479 transitions. [2024-10-24 12:52:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-24 12:52:24,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:24,299 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 12:52:24,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 12:52:24,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:24,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:24,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash 679048443, now seen corresponding path program 1 times [2024-10-24 12:52:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:24,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449131767] [2024-10-24 12:52:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:24,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:52:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:26,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:52:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:52:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 12:52:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 12:52:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:26,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 12:52:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 12:52:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449131767] [2024-10-24 12:52:26,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449131767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:52:26,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:52:26,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-24 12:52:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675352457] [2024-10-24 12:52:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:52:26,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 12:52:26,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 12:52:26,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-10-24 12:52:26,855 INFO L87 Difference]: Start difference. First operand 358 states and 479 transitions. Second operand has 19 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 12:52:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:52:28,680 INFO L93 Difference]: Finished difference Result 652 states and 880 transitions. [2024-10-24 12:52:28,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 12:52:28,681 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 63 [2024-10-24 12:52:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:52:28,683 INFO L225 Difference]: With dead ends: 652 [2024-10-24 12:52:28,683 INFO L226 Difference]: Without dead ends: 449 [2024-10-24 12:52:28,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2024-10-24 12:52:28,687 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 152 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 12:52:28,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1176 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 12:52:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-24 12:52:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 377. [2024-10-24 12:52:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 274 states have (on average 1.2846715328467153) internal successors, (352), 285 states have internal predecessors, (352), 71 states have call successors, (71), 31 states have call predecessors, (71), 31 states have return successors, (88), 60 states have call predecessors, (88), 65 states have call successors, (88) [2024-10-24 12:52:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 511 transitions. [2024-10-24 12:52:28,737 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 511 transitions. Word has length 63 [2024-10-24 12:52:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:52:28,738 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 511 transitions. [2024-10-24 12:52:28,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 7 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 12:52:28,738 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 511 transitions. [2024-10-24 12:52:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 12:52:28,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:52:28,740 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2024-10-24 12:52:28,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:52:28,741 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:52:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:52:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash -438768949, now seen corresponding path program 1 times [2024-10-24 12:52:28,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:52:28,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677815359] [2024-10-24 12:52:28,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:28,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:52:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:52:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 12:52:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 12:52:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:52:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 12:52:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 12:52:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 12:52:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 12:52:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:30,519 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 12:52:30,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:52:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677815359] [2024-10-24 12:52:30,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677815359] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366411388] [2024-10-24 12:52:30,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:52:30,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:52:30,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:52:30,522 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:52:30,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 12:52:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:52:31,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 2575 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-24 12:52:31,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:52:31,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 12:52:31,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-24 12:52:31,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:52:31,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 12:52:31,521 INFO L349 Elim1Store]: treesize reduction 37, result has 31.5 percent of original size [2024-10-24 12:52:31,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 24 [2024-10-24 12:52:31,862 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2024-10-24 12:52:31,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 32 [2024-10-24 12:52:32,174 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-10-24 12:52:32,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-10-24 12:52:32,761 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-24 12:52:32,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-24 12:52:32,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-10-24 12:52:36,844 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_aws_byte_cursor_advance_nospec_~cursor#1.base_BEFORE_CALL_12| Int) (|v_aws_byte_cursor_advance_nospec_~cursor#1.offset_BEFORE_CALL_11| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#4.base| |v_aws_byte_cursor_advance_nospec_~cursor#1.base_BEFORE_CALL_12|) (+ |v_aws_byte_cursor_advance_nospec_~cursor#1.offset_BEFORE_CALL_11| 8)))) (and (<= (+ .cse0 2) |v_aws_byte_cursor_advance_nospec_~cursor#1.base_BEFORE_CALL_12|) (not (= .cse0 0))))) is different from true [2024-10-24 12:52:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-10-24 12:52:41,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:52:41,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_797 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#4.base| |c_aws_byte_cursor_advance_nospec_~#rv~7#1.base| v_ArrVal_797) |c_aws_byte_cursor_advance_nospec_~cursor#1.base|) (+ |c_aws_byte_cursor_advance_nospec_~cursor#1.offset| 8)) 0))) is different from false [2024-10-24 12:52:41,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366411388] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:52:41,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:52:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 39 [2024-10-24 12:52:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037665597] [2024-10-24 12:52:41,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:52:41,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-24 12:52:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:52:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-24 12:52:41,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1762, Unknown=3, NotChecked=170, Total=2070 [2024-10-24 12:52:41,430 INFO L87 Difference]: Start difference. First operand 377 states and 511 transitions. Second operand has 39 states, 32 states have (on average 2.5625) internal successors, (82), 33 states have internal predecessors, (82), 13 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2024-10-24 12:52:48,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 12:52:56,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]