./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_erase_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_erase_harness_negated.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5aa4df3bf07993e90fd6085d301926d2fe237de2ffd3a09881087885f4330551 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:39:29,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:39:29,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 14:39:29,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:39:29,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:39:29,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:39:29,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:39:29,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:39:29,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:39:29,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:39:29,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:39:29,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:39:29,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:39:29,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:39:29,878 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:39:29,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:39:29,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:39:29,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:39:29,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:39:29,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:39:29,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:39:29,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:39:29,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:39:29,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:39:29,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:39:29,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:39:29,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:39:29,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:39:29,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:39:29,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:39:29,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:39:29,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:39:29,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:39:29,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:39:29,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:39:29,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:39:29,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:39:29,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:39:29,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:39:29,884 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5aa4df3bf07993e90fd6085d301926d2fe237de2ffd3a09881087885f4330551 [2024-10-11 14:39:30,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:39:30,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:39:30,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:39:30,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:39:30,096 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:39:30,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_erase_harness_negated.i [2024-10-11 14:39:31,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:39:31,610 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:39:31,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_erase_harness_negated.i [2024-10-11 14:39:31,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5357c5d1b/8b52e649d7ba4e3382e2463ad0940623/FLAG65cdae538 [2024-10-11 14:39:31,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5357c5d1b/8b52e649d7ba4e3382e2463ad0940623 [2024-10-11 14:39:31,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:39:31,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:39:31,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:39:31,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:39:31,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:39:31,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:31" (1/1) ... [2024-10-11 14:39:31,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c15bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:31, skipping insertion in model container [2024-10-11 14:39:31,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:31" (1/1) ... [2024-10-11 14:39:31,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:39:32,137 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_erase_harness_negated.i[4494,4507] [2024-10-11 14:39:32,142 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_erase_harness_negated.i[4554,4567] [2024-10-11 14:39:32,582 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,583 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,583 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,584 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,584 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,592 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,592 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,593 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,594 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,595 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,595 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,596 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,596 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,856 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,856 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,859 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,860 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,862 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,862 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,864 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,869 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,900 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,905 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:39:32,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:39:32,945 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_erase_harness_negated.i[4494,4507] [2024-10-11 14:39:32,949 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_list_erase_harness_negated.i[4554,4567] [2024-10-11 14:39:32,989 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,989 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,989 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,990 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:32,990 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,001 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,002 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,002 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,003 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,003 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,004 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,004 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,004 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,064 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,064 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,065 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,066 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,066 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,067 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,067 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,071 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,075 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7793-7804] [2024-10-11 14:39:33,092 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,095 WARN L1659 CHandler]: Possible shadowing of function index [2024-10-11 14:39:33,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:39:33,242 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:39:33,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33 WrapperNode [2024-10-11 14:39:33,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:39:33,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:39:33,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:39:33,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:39:33,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,363 INFO L138 Inliner]: procedures = 676, calls = 1671, calls flagged for inlining = 52, calls inlined = 11, statements flattened = 732 [2024-10-11 14:39:33,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:39:33,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:39:33,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:39:33,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:39:33,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,468 INFO L175 MemorySlicer]: Split 329 memory accesses to 6 slices as follows [236, 2, 3, 73, 6, 9]. 72 percent of accesses are in the largest equivalence class. The 254 initializations are split as follows [236, 2, 1, 10, 0, 5]. The 11 writes are split as follows [0, 0, 1, 6, 2, 2]. [2024-10-11 14:39:33,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:39:33,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:39:33,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:39:33,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:39:33,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (1/1) ... [2024-10-11 14:39:33,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:39:33,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:33,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:39:33,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:39:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure memmove_impl [2024-10-11 14:39:33,704 INFO L138 BoogieDeclarations]: Found implementation of procedure memmove_impl [2024-10-11 14:39:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 14:39:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_bounded [2024-10-11 14:39:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_bounded [2024-10-11 14:39:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_is_valid [2024-10-11 14:39:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_is_valid [2024-10-11 14:39:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-10-11 14:39:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-10-11 14:39:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:39:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:39:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:39:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 14:39:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 14:39:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 14:39:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2024-10-11 14:39:33,706 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2024-10-11 14:39:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 14:39:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 14:39:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:39:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:39:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint8_t [2024-10-11 14:39:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint8_t [2024-10-11 14:39:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 14:39:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 14:39:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 14:39:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 14:39:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 14:39:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 14:39:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:39:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:39:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-10-11 14:39:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-10-11 14:39:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2024-10-11 14:39:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2024-10-11 14:39:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_size_t [2024-10-11 14:39:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_size_t [2024-10-11 14:39:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2024-10-11 14:39:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2024-10-11 14:39:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_length [2024-10-11 14:39:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_length [2024-10-11 14:39:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:39:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_list_pop_back [2024-10-11 14:39:33,710 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_list_pop_back [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 14:39:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 14:39:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 14:39:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 14:39:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 14:39:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-10-11 14:39:33,711 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-10-11 14:39:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2024-10-11 14:39:33,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2024-10-11 14:39:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure my_memmove [2024-10-11 14:39:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memmove [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure memset_impl [2024-10-11 14:39:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure memset_impl [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure my_memset [2024-10-11 14:39:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure my_memset [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_array_list_has_allocated_data_member [2024-10-11 14:39:33,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_array_list_has_allocated_data_member [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:39:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:39:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:39:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:39:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 14:39:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 14:39:33,964 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:39:33,967 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:39:34,644 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2024-10-11 14:39:34,645 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:39:34,711 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:39:34,712 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:39:34,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:34 BoogieIcfgContainer [2024-10-11 14:39:34,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:39:34,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:39:34,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:39:34,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:39:34,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:39:31" (1/3) ... [2024-10-11 14:39:34,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a916b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:34, skipping insertion in model container [2024-10-11 14:39:34,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:33" (2/3) ... [2024-10-11 14:39:34,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a916b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:34, skipping insertion in model container [2024-10-11 14:39:34,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:34" (3/3) ... [2024-10-11 14:39:34,720 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_array_list_erase_harness_negated.i [2024-10-11 14:39:34,732 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:39:34,732 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:39:34,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:39:34,794 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;@5c3a5049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:39:34,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:39:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 124 states have (on average 1.217741935483871) internal successors, (151), 125 states have internal predecessors, (151), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-11 14:39:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 14:39:34,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:34,807 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:34,807 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:34,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1311222341, now seen corresponding path program 1 times [2024-10-11 14:39:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:34,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837919351] [2024-10-11 14:39:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:39:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:39:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:39:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:39:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:39:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 14:39:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 14:39:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:39:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:39:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:39:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:39:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-11 14:39:35,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:35,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837919351] [2024-10-11 14:39:35,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837919351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:35,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:35,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:39:35,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970066284] [2024-10-11 14:39:35,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:35,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:39:35,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:35,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:39:35,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:39:35,535 INFO L87 Difference]: Start difference. First operand has 234 states, 124 states have (on average 1.217741935483871) internal successors, (151), 125 states have internal predecessors, (151), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:39:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:36,728 INFO L93 Difference]: Finished difference Result 502 states and 796 transitions. [2024-10-11 14:39:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:39:36,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 83 [2024-10-11 14:39:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:36,743 INFO L225 Difference]: With dead ends: 502 [2024-10-11 14:39:36,743 INFO L226 Difference]: Without dead ends: 273 [2024-10-11 14:39:36,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:39:36,752 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 123 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:36,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 388 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 14:39:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-11 14:39:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 232. [2024-10-11 14:39:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 123 states have (on average 1.2032520325203253) internal successors, (148), 124 states have internal predecessors, (148), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 14:39:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 323 transitions. [2024-10-11 14:39:36,810 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 323 transitions. Word has length 83 [2024-10-11 14:39:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:36,810 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 323 transitions. [2024-10-11 14:39:36,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:39:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 323 transitions. [2024-10-11 14:39:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 14:39:36,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:36,813 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:36,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:39:36,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:36,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash 117849801, now seen corresponding path program 1 times [2024-10-11 14:39:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612679830] [2024-10-11 14:39:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:36,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:39:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:39:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:39:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:39:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:39:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 14:39:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 14:39:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:39:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:39:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:39:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:39:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 14:39:37,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:37,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612679830] [2024-10-11 14:39:37,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612679830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:39:37,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393386614] [2024-10-11 14:39:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:37,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:37,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:37,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:39:37,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:39:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:37,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 2084 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 14:39:37,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:39:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 14:39:38,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:39:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-11 14:39:38,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393386614] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 14:39:38,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:39:38,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 9] total 17 [2024-10-11 14:39:38,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421620589] [2024-10-11 14:39:38,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:38,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:39:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:38,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:39:38,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:39:38,156 INFO L87 Difference]: Start difference. First operand 232 states and 323 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:39:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:38,384 INFO L93 Difference]: Finished difference Result 242 states and 350 transitions. [2024-10-11 14:39:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:39:38,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 83 [2024-10-11 14:39:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:38,387 INFO L225 Difference]: With dead ends: 242 [2024-10-11 14:39:38,387 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 14:39:38,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:39:38,390 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 3 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:38,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1497 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:39:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 14:39:38,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2024-10-11 14:39:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 127 states have (on average 1.1968503937007875) internal successors, (152), 129 states have internal predecessors, (152), 89 states have call successors, (89), 21 states have call predecessors, (89), 22 states have return successors, (106), 88 states have call predecessors, (106), 88 states have call successors, (106) [2024-10-11 14:39:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 347 transitions. [2024-10-11 14:39:38,428 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 347 transitions. Word has length 83 [2024-10-11 14:39:38,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:38,428 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 347 transitions. [2024-10-11 14:39:38,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 14:39:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 347 transitions. [2024-10-11 14:39:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 14:39:38,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:38,432 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:38,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:39:38,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:38,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:38,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash 765258100, now seen corresponding path program 1 times [2024-10-11 14:39:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:38,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022707426] [2024-10-11 14:39:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:38,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:38,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:39:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:38,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:39:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:39:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:39:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:39:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 14:39:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 14:39:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:39:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 14:39:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:39:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:39:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-11 14:39:39,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:39,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022707426] [2024-10-11 14:39:39,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022707426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:39,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:39,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:39:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449981301] [2024-10-11 14:39:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:39,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:39:39,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:39,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:39:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:39:39,187 INFO L87 Difference]: Start difference. First operand 239 states and 347 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 6 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-11 14:39:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:40,732 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2024-10-11 14:39:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:39:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 6 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 96 [2024-10-11 14:39:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:40,735 INFO L225 Difference]: With dead ends: 494 [2024-10-11 14:39:40,735 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 14:39:40,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:39:40,737 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 253 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:40,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1152 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 14:39:40,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 14:39:40,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2024-10-11 14:39:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 132 states have (on average 1.196969696969697) internal successors, (158), 134 states have internal predecessors, (158), 94 states have call successors, (94), 22 states have call predecessors, (94), 23 states have return successors, (106), 93 states have call predecessors, (106), 93 states have call successors, (106) [2024-10-11 14:39:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 358 transitions. [2024-10-11 14:39:40,776 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 358 transitions. Word has length 96 [2024-10-11 14:39:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:40,777 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 358 transitions. [2024-10-11 14:39:40,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 7 states have internal predecessors, (41), 6 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2024-10-11 14:39:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 358 transitions. [2024-10-11 14:39:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 14:39:40,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:40,781 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:40,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:39:40,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:40,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1326642679, now seen corresponding path program 1 times [2024-10-11 14:39:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920909953] [2024-10-11 14:39:40,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:39:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:39:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:39:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:39:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:39:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 14:39:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 14:39:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 14:39:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:39:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:39:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:39:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:39:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:39:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-11 14:39:41,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:41,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920909953] [2024-10-11 14:39:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920909953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:41,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:41,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:39:41,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873485829] [2024-10-11 14:39:41,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:41,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:39:41,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:41,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:39:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:39:41,352 INFO L87 Difference]: Start difference. First operand 250 states and 358 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:39:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:42,760 INFO L93 Difference]: Finished difference Result 295 states and 429 transitions. [2024-10-11 14:39:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:39:42,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 97 [2024-10-11 14:39:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:42,763 INFO L225 Difference]: With dead ends: 295 [2024-10-11 14:39:42,763 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 14:39:42,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:39:42,764 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 126 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:42,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1058 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 14:39:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 14:39:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 254. [2024-10-11 14:39:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 137 states have internal predecessors, (161), 94 states have call successors, (94), 23 states have call predecessors, (94), 24 states have return successors, (106), 93 states have call predecessors, (106), 93 states have call successors, (106) [2024-10-11 14:39:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 361 transitions. [2024-10-11 14:39:42,782 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 361 transitions. Word has length 97 [2024-10-11 14:39:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:42,782 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 361 transitions. [2024-10-11 14:39:42,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 14:39:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 361 transitions. [2024-10-11 14:39:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 14:39:42,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:42,784 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:42,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:39:42,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:42,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash -364051244, now seen corresponding path program 1 times [2024-10-11 14:39:42,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:42,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401296611] [2024-10-11 14:39:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:42,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:42,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:42,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:39:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:42,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:39:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:39:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:39:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:39:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 14:39:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 14:39:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 14:39:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:39:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:39:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:39:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:39:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:39:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 14:39:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 14:39:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-11 14:39:43,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:43,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401296611] [2024-10-11 14:39:43,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401296611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:43,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:39:43,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:39:43,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355495010] [2024-10-11 14:39:43,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:43,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:39:43,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:43,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:39:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:39:43,152 INFO L87 Difference]: Start difference. First operand 254 states and 361 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:39:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:44,457 INFO L93 Difference]: Finished difference Result 375 states and 569 transitions. [2024-10-11 14:39:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:39:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 109 [2024-10-11 14:39:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:44,460 INFO L225 Difference]: With dead ends: 375 [2024-10-11 14:39:44,460 INFO L226 Difference]: Without dead ends: 332 [2024-10-11 14:39:44,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:39:44,461 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 157 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:39:44,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1119 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 14:39:44,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-11 14:39:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 256. [2024-10-11 14:39:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 137 states have (on average 1.1897810218978102) internal successors, (163), 139 states have internal predecessors, (163), 94 states have call successors, (94), 23 states have call predecessors, (94), 24 states have return successors, (106), 93 states have call predecessors, (106), 93 states have call successors, (106) [2024-10-11 14:39:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 363 transitions. [2024-10-11 14:39:44,479 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 363 transitions. Word has length 109 [2024-10-11 14:39:44,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:44,479 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 363 transitions. [2024-10-11 14:39:44,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 14:39:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 363 transitions. [2024-10-11 14:39:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 14:39:44,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:39:44,481 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:39:44,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:39:44,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:39:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:39:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1789466405, now seen corresponding path program 1 times [2024-10-11 14:39:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:39:44,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842950228] [2024-10-11 14:39:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:44,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:39:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:39:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:39:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:39:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:39:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 14:39:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 14:39:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 14:39:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:39:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 14:39:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 14:39:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 14:39:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:39:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:39:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 14:39:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 14:39:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 14:39:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 14:39:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 14:39:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 14:39:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-11 14:39:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:39:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842950228] [2024-10-11 14:39:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842950228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:39:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041588029] [2024-10-11 14:39:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:39:45,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:45,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:39:45,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:39:45,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:39:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:39:45,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 2186 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 14:39:45,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:39:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 14:39:45,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:39:45,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041588029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:39:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:39:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2024-10-11 14:39:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272081506] [2024-10-11 14:39:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:39:45,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:39:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:39:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:39:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:39:45,574 INFO L87 Difference]: Start difference. First operand 256 states and 363 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 14:39:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:39:45,820 INFO L93 Difference]: Finished difference Result 287 states and 395 transitions. [2024-10-11 14:39:45,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:39:45,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 110 [2024-10-11 14:39:45,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:39:45,821 INFO L225 Difference]: With dead ends: 287 [2024-10-11 14:39:45,822 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 14:39:45,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:39:45,824 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 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-11 14:39:45,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:39:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 14:39:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 14:39:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:39:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 14:39:45,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2024-10-11 14:39:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:39:45,827 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 14:39:45,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (20), 2 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 14:39:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 14:39:45,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 14:39:45,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:39:45,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:39:46,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:39:46,036 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 14:39:46,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 14:39:46,258 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:39:46,267 WARN L155 FloydHoareUtils]: Requires clause for bounded_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 14:39:46,272 WARN L155 FloydHoareUtils]: Requires clause for ensure_array_list_has_allocated_data_member contained old-variable. Original clause: (and (= |#memory_$Pointer$#3.offset| |old(#memory_$Pointer$#3.offset)|) (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#5.offset)| |#memory_$Pointer$#5.offset|) (= |#memory_int#5| |old(#memory_int#5)|) (= |old(#memory_$Pointer$#3.base)| |#memory_$Pointer$#3.base|) (= |#memory_$Pointer$#5.base| |old(#memory_$Pointer$#5.base)|) (= |#memory_real#5| |old(#memory_real#5)|) (= |#memory_real#3| |old(#memory_real#3)|) (= |old(#valid)| |#valid|) (= |#memory_int#3| |old(#memory_int#3)|)) Eliminated clause: true [2024-10-11 14:39:46,274 WARN L155 FloydHoareUtils]: Requires clause for aws_array_list_is_valid contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |#memory_real#2| |old(#memory_real#2)|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 14:39:46,279 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~list!base [2024-10-11 14:39:46,282 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-11 14:39:46,282 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-11 14:39:46,282 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_real#2 [2024-10-11 14:39:46,283 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_real#2 [2024-10-11 14:39:46,283 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 14:39:46,283 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-10-11 14:39:46,283 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 14:39:46,283 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-11 14:39:46,283 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 14:39:46,283 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-10-11 14:39:46,283 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 14:39:46,284 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-10-11 14:39:46,285 WARN L155 FloydHoareUtils]: Requires clause for aws_raise_error contained old-variable. Original clause: (= ~tl_last_error~0 |old(~tl_last_error~0)|) Eliminated clause: true [2024-10-11 14:39:46,287 WARN L155 FloydHoareUtils]: Requires clause for __CPROVER_overflow_mult contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 14:39:46,291 WARN L155 FloydHoareUtils]: Requires clause for aws_mul_size_checked contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |#memory_real#2| |old(#memory_real#2)|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-10-11 14:39:46,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:39:46 BoogieIcfgContainer [2024-10-11 14:39:46,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:39:46,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:39:46,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:39:46,293 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:39:46,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:34" (3/4) ... [2024-10-11 14:39:46,294 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 14:39:46,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2024-10-11 14:39:46,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_array_list_has_allocated_data_member [2024-10-11 14:39:46,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memset [2024-10-11 14:39:46,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure memset_impl [2024-10-11 14:39:46,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint8_t [2024-10-11 14:39:46,297 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_is_bounded [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_is_valid [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assert_byte_from_buffer_matches [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_size_t [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure my_memmove [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure memmove_impl [2024-10-11 14:39:46,298 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2024-10-11 14:39:46,299 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_length [2024-10-11 14:39:46,299 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_list_pop_back [2024-10-11 14:39:46,299 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 14:39:46,314 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 162 nodes and edges [2024-10-11 14:39:46,316 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 70 nodes and edges [2024-10-11 14:39:46,317 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-10-11 14:39:46,318 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 14:39:46,318 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 14:39:46,319 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 14:39:46,320 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 14:39:46,321 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 14:39:46,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:39:46,642 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 14:39:46,642 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:39:46,643 INFO L158 Benchmark]: Toolchain (without parser) took 14789.76ms. Allocated memory was 182.5MB in the beginning and 427.8MB in the end (delta: 245.4MB). Free memory was 124.5MB in the beginning and 239.0MB in the end (delta: -114.6MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. [2024-10-11 14:39:46,643 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:39:46,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1388.83ms. Allocated memory is still 182.5MB. Free memory was 124.5MB in the beginning and 81.8MB in the end (delta: 42.6MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2024-10-11 14:39:46,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.46ms. Allocated memory is still 182.5MB. Free memory was 81.8MB in the beginning and 72.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 14:39:46,644 INFO L158 Benchmark]: Boogie Preprocessor took 202.74ms. Allocated memory was 182.5MB in the beginning and 230.7MB in the end (delta: 48.2MB). Free memory was 72.3MB in the beginning and 173.2MB in the end (delta: -100.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-10-11 14:39:46,645 INFO L158 Benchmark]: RCFGBuilder took 1145.56ms. Allocated memory is still 230.7MB. Free memory was 173.2MB in the beginning and 127.4MB in the end (delta: 45.8MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2024-10-11 14:39:46,645 INFO L158 Benchmark]: TraceAbstraction took 11577.41ms. Allocated memory was 230.7MB in the beginning and 427.8MB in the end (delta: 197.1MB). Free memory was 126.4MB in the beginning and 367.0MB in the end (delta: -240.6MB). Peak memory consumption was 202.0MB. Max. memory is 16.1GB. [2024-10-11 14:39:46,645 INFO L158 Benchmark]: Witness Printer took 350.65ms. Allocated memory is still 427.8MB. Free memory was 367.0MB in the beginning and 239.0MB in the end (delta: 127.9MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2024-10-11 14:39:46,647 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1388.83ms. Allocated memory is still 182.5MB. Free memory was 124.5MB in the beginning and 81.8MB in the end (delta: 42.6MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.46ms. Allocated memory is still 182.5MB. Free memory was 81.8MB in the beginning and 72.3MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 202.74ms. Allocated memory was 182.5MB in the beginning and 230.7MB in the end (delta: 48.2MB). Free memory was 72.3MB in the beginning and 173.2MB in the end (delta: -100.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1145.56ms. Allocated memory is still 230.7MB. Free memory was 173.2MB in the beginning and 127.4MB in the end (delta: 45.8MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11577.41ms. Allocated memory was 230.7MB in the beginning and 427.8MB in the end (delta: 197.1MB). Free memory was 126.4MB in the beginning and 367.0MB in the end (delta: -240.6MB). Peak memory consumption was 202.0MB. Max. memory is 16.1GB. * Witness Printer took 350.65ms. Allocated memory is still 427.8MB. Free memory was 367.0MB in the beginning and 239.0MB in the end (delta: 127.9MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 7793]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : : "r"(pBuf) : "memory"); [7793-7804] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~list!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_real#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_real#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 234 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 692 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 662 mSDsluCounter, 5510 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4233 mSDsCounter, 1138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4314 IncrementalHoareTripleChecker+Invalid, 5452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1138 mSolverCounterUnsat, 1277 mSDtfsCounter, 4314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=5, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 196 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 771 NumberOfCodeBlocks, 771 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 845 ConstructedInterpolants, 0 QuantifiedInterpolants, 1903 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4270 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 824/846 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7413]: Procedure Contract for my_memset Derived contract for procedure my_memset. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 7403]: Procedure Contract for memset_impl Derived contract for procedure memset_impl. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 267]: Procedure Contract for nondet_uint8_t Derived contract for procedure nondet_uint8_t. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 210]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 1988]: Procedure Contract for aws_raise_error Derived contract for procedure aws_raise_error. Ensures: (((long) \result + 1) <= 0) - ProcedureContractResult [Line: 7164]: Procedure Contract for assert_byte_from_buffer_matches Derived contract for procedure assert_byte_from_buffer_matches. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 7360]: Procedure Contract for my_memmove Derived contract for procedure my_memmove. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 7343]: Procedure Contract for memmove_impl Derived contract for procedure memmove_impl. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 3487]: Procedure Contract for aws_array_list_length Derived contract for procedure aws_array_list_length. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 3429]: Procedure Contract for aws_array_list_pop_back Derived contract for procedure aws_array_list_pop_back. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 222]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: 0 Ensures: 0 RESULT: Ultimate proved your program to be correct! [2024-10-11 14:39:46,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE