./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/uthash-2.0.2/uthash_JEN_nondet_test2-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:29:14,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:29:14,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:29:14,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:29:14,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:29:14,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:29:14,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:29:14,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:29:14,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:29:14,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:29:14,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:29:14,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:29:14,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:29:14,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:29:14,128 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:29:14,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:29:14,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:29:14,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:29:14,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:29:14,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:29:14,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:29:14,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:29:14,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:29:14,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:29:14,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:29:14,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:29:14,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:29:14,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:29:14,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:29:14,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:29:14,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:29:14,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:29:14,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:29:14,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:29:14,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:29:14,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:29:14,134 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:29:14,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:29:14,134 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:29:14,134 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:29:14,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:29:14,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:29:14,135 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-10-11 16:29:14,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:29:14,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:29:14,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:29:14,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:29:14,348 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:29:14,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-10-11 16:29:15,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:29:15,760 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:29:15,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-10-11 16:29:15,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/200dcb9dc/f862067bf4a24ddbaea585308d401cf3/FLAG5c4ee2555 [2024-10-11 16:29:15,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/200dcb9dc/f862067bf4a24ddbaea585308d401cf3 [2024-10-11 16:29:15,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:29:15,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:29:15,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:29:15,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:29:15,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:29:15,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:29:15" (1/1) ... [2024-10-11 16:29:15,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277ab66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:15, skipping insertion in model container [2024-10-11 16:29:15,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:29:15" (1/1) ... [2024-10-11 16:29:15,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:29:16,183 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/uthash-2.0.2/uthash_JEN_nondet_test2-2.i[37435,37448] [2024-10-11 16:29:16,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:29:16,297 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:29:16,330 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/uthash-2.0.2/uthash_JEN_nondet_test2-2.i[37435,37448] [2024-10-11 16:29:16,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:29:16,408 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:29:16,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16 WrapperNode [2024-10-11 16:29:16,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:29:16,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:29:16,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:29:16,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:29:16,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,497 INFO L138 Inliner]: procedures = 207, calls = 272, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1443 [2024-10-11 16:29:16,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:29:16,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:29:16,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:29:16,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:29:16,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,591 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-11 16:29:16,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:29:16,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:29:16,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:29:16,658 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:29:16,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (1/1) ... [2024-10-11 16:29:16,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:29:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:16,686 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 16:29:16,688 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 16:29:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:29:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:29:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:29:16,727 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:29:16,727 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:29:16,727 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:29:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:29:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:29:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:29:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:29:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:29:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:29:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:29:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:29:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:29:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:29:16,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:29:16,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:29:16,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:29:16,913 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:29:16,917 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:29:18,060 INFO L? ?]: Removed 321 outVars from TransFormulas that were not future-live. [2024-10-11 16:29:18,060 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:29:18,093 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:29:18,094 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 16:29:18,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:29:18 BoogieIcfgContainer [2024-10-11 16:29:18,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:29:18,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:29:18,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:29:18,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:29:18,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:29:15" (1/3) ... [2024-10-11 16:29:18,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23741802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:29:18, skipping insertion in model container [2024-10-11 16:29:18,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:29:16" (2/3) ... [2024-10-11 16:29:18,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23741802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:29:18, skipping insertion in model container [2024-10-11 16:29:18,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:29:18" (3/3) ... [2024-10-11 16:29:18,100 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-2.i [2024-10-11 16:29:18,115 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:29:18,115 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:29:18,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:29:18,173 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;@76a88be3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:29:18,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:29:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 390 states have (on average 1.6282051282051282) internal successors, (635), 391 states have internal predecessors, (635), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 16:29:18,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:18,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:29:18,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1645702792, now seen corresponding path program 1 times [2024-10-11 16:29:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:18,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682388105] [2024-10-11 16:29:18,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:18,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:29:18,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:18,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682388105] [2024-10-11 16:29:18,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682388105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:18,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:29:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120461444] [2024-10-11 16:29:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:18,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:29:18,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:18,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:29:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:29:18,343 INFO L87 Difference]: Start difference. First operand has 396 states, 390 states have (on average 1.6282051282051282) internal successors, (635), 391 states have internal predecessors, (635), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 16:29:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:18,406 INFO L93 Difference]: Finished difference Result 790 states and 1279 transitions. [2024-10-11 16:29:18,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:29:18,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 16:29:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:18,420 INFO L225 Difference]: With dead ends: 790 [2024-10-11 16:29:18,420 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 16:29:18,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:29:18,426 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:18,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:29:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 16:29:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-11 16:29:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.4576271186440677) internal successors, (516), 354 states have internal predecessors, (516), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 522 transitions. [2024-10-11 16:29:18,478 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 522 transitions. Word has length 10 [2024-10-11 16:29:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:18,479 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 522 transitions. [2024-10-11 16:29:18,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 16:29:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-10-11 16:29:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:29:18,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:18,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:18,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:29:18,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:18,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1496970619, now seen corresponding path program 1 times [2024-10-11 16:29:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:18,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491166551] [2024-10-11 16:29:18,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:29:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:18,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491166551] [2024-10-11 16:29:18,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491166551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:18,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:18,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:29:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795762399] [2024-10-11 16:29:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:18,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:18,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:18,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:18,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:18,738 INFO L87 Difference]: Start difference. First operand 359 states and 522 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 16:29:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:18,838 INFO L93 Difference]: Finished difference Result 520 states and 758 transitions. [2024-10-11 16:29:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 16:29:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:18,842 INFO L225 Difference]: With dead ends: 520 [2024-10-11 16:29:18,843 INFO L226 Difference]: Without dead ends: 362 [2024-10-11 16:29:18,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:29:18,846 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 105 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:18,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1382 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:29:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-11 16:29:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 359. [2024-10-11 16:29:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 354 states have (on average 1.4378531073446328) internal successors, (509), 354 states have internal predecessors, (509), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 515 transitions. [2024-10-11 16:29:18,871 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 515 transitions. Word has length 65 [2024-10-11 16:29:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:18,871 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 515 transitions. [2024-10-11 16:29:18,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 16:29:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 515 transitions. [2024-10-11 16:29:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:29:18,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:18,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:18,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:29:18,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:18,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:18,875 INFO L85 PathProgramCache]: Analyzing trace with hash 316506247, now seen corresponding path program 1 times [2024-10-11 16:29:18,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:18,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341995120] [2024-10-11 16:29:18,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:29:19,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:19,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341995120] [2024-10-11 16:29:19,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341995120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:19,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:19,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:29:19,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359383242] [2024-10-11 16:29:19,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:19,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:29:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:19,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:29:19,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:29:19,311 INFO L87 Difference]: Start difference. First operand 359 states and 515 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 16:29:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:19,423 INFO L93 Difference]: Finished difference Result 873 states and 1253 transitions. [2024-10-11 16:29:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:29:19,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-11 16:29:19,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:19,426 INFO L225 Difference]: With dead ends: 873 [2024-10-11 16:29:19,426 INFO L226 Difference]: Without dead ends: 712 [2024-10-11 16:29:19,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:29:19,427 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 503 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:19,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1993 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:29:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-10-11 16:29:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 361. [2024-10-11 16:29:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 356 states have (on average 1.4353932584269662) internal successors, (511), 356 states have internal predecessors, (511), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 517 transitions. [2024-10-11 16:29:19,438 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 517 transitions. Word has length 65 [2024-10-11 16:29:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:19,439 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 517 transitions. [2024-10-11 16:29:19,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 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 16:29:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 517 transitions. [2024-10-11 16:29:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 16:29:19,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:19,444 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:19,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:29:19,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:19,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash -640932924, now seen corresponding path program 1 times [2024-10-11 16:29:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:19,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608442437] [2024-10-11 16:29:19,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:19,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:29:19,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608442437] [2024-10-11 16:29:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608442437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:19,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:19,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:29:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70965736] [2024-10-11 16:29:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:19,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:19,687 INFO L87 Difference]: Start difference. First operand 361 states and 517 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 16:29:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:19,759 INFO L93 Difference]: Finished difference Result 676 states and 964 transitions. [2024-10-11 16:29:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:29:19,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-10-11 16:29:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:19,762 INFO L225 Difference]: With dead ends: 676 [2024-10-11 16:29:19,762 INFO L226 Difference]: Without dead ends: 319 [2024-10-11 16:29:19,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:29:19,765 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 30 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:19,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1213 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:29:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-11 16:29:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-10-11 16:29:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 314 states have (on average 1.3821656050955413) internal successors, (434), 314 states have internal predecessors, (434), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 440 transitions. [2024-10-11 16:29:19,773 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 440 transitions. Word has length 141 [2024-10-11 16:29:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:19,774 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 440 transitions. [2024-10-11 16:29:19,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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 16:29:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 440 transitions. [2024-10-11 16:29:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 16:29:19,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:19,777 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:19,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:29:19,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:19,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1670755272, now seen corresponding path program 1 times [2024-10-11 16:29:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:19,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423102434] [2024-10-11 16:29:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:29:19,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423102434] [2024-10-11 16:29:19,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423102434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:19,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:19,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:29:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431459507] [2024-10-11 16:29:19,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:19,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:29:19,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:29:19,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:29:19,946 INFO L87 Difference]: Start difference. First operand 319 states and 440 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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 16:29:19,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:19,999 INFO L93 Difference]: Finished difference Result 858 states and 1192 transitions. [2024-10-11 16:29:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:29:19,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2024-10-11 16:29:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:20,003 INFO L225 Difference]: With dead ends: 858 [2024-10-11 16:29:20,003 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 16:29:20,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:29:20,005 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 253 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:20,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1030 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:29:20,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 16:29:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2024-10-11 16:29:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 536 states have (on average 1.3936567164179106) internal successors, (747), 536 states have internal predecessors, (747), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2024-10-11 16:29:20,022 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 141 [2024-10-11 16:29:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:20,023 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2024-10-11 16:29:20,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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 16:29:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2024-10-11 16:29:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 16:29:20,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:20,027 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:20,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:29:20,027 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:20,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1920510785, now seen corresponding path program 1 times [2024-10-11 16:29:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:20,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950865667] [2024-10-11 16:29:20,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:20,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:29:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:20,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:29:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:20,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:20,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950865667] [2024-10-11 16:29:20,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950865667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:20,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:20,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:29:20,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785487337] [2024-10-11 16:29:20,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:20,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:20,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:20,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:20,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:20,220 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:20,390 INFO L93 Difference]: Finished difference Result 1050 states and 1473 transitions. [2024-10-11 16:29:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:20,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2024-10-11 16:29:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:20,394 INFO L225 Difference]: With dead ends: 1050 [2024-10-11 16:29:20,394 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 16:29:20,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:29:20,395 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 3 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:20,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1195 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:29:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 16:29:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 541. [2024-10-11 16:29:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 536 states have (on average 1.382462686567164) internal successors, (741), 536 states have internal predecessors, (741), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 747 transitions. [2024-10-11 16:29:20,407 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 747 transitions. Word has length 154 [2024-10-11 16:29:20,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:20,407 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 747 transitions. [2024-10-11 16:29:20,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 747 transitions. [2024-10-11 16:29:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 16:29:20,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:20,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:20,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:29:20,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1058677183, now seen corresponding path program 1 times [2024-10-11 16:29:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293990800] [2024-10-11 16:29:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:29:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:20,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:29:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:20,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:20,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293990800] [2024-10-11 16:29:20,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293990800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:20,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:20,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:29:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895382569] [2024-10-11 16:29:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:20,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:29:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:20,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:29:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:29:20,675 INFO L87 Difference]: Start difference. First operand 541 states and 747 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:20,986 INFO L93 Difference]: Finished difference Result 1072 states and 1487 transitions. [2024-10-11 16:29:20,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:29:20,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 154 [2024-10-11 16:29:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:20,989 INFO L225 Difference]: With dead ends: 1072 [2024-10-11 16:29:20,989 INFO L226 Difference]: Without dead ends: 622 [2024-10-11 16:29:20,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:29:20,990 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 1425 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:20,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 1533 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:29:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-10-11 16:29:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 406. [2024-10-11 16:29:21,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 401 states have (on average 1.3566084788029926) internal successors, (544), 401 states have internal predecessors, (544), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 550 transitions. [2024-10-11 16:29:21,001 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 550 transitions. Word has length 154 [2024-10-11 16:29:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:21,001 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 550 transitions. [2024-10-11 16:29:21,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 550 transitions. [2024-10-11 16:29:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 16:29:21,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:21,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:21,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:29:21,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:21,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -942364693, now seen corresponding path program 1 times [2024-10-11 16:29:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049991296] [2024-10-11 16:29:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:29:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:21,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:29:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:29:21,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:21,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049991296] [2024-10-11 16:29:21,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049991296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:21,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843150621] [2024-10-11 16:29:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:21,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:21,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:21,442 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 16:29:21,443 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 16:29:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:21,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 16:29:21,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:21,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:29:21,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 16:29:22,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:29:22,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 58 [2024-10-11 16:29:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:22,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:29:22,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843150621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:22,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:29:22,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-10-11 16:29:22,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512635547] [2024-10-11 16:29:22,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:22,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:29:22,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:22,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:29:22,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:29:22,519 INFO L87 Difference]: Start difference. First operand 406 states and 550 transitions. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:23,574 INFO L93 Difference]: Finished difference Result 981 states and 1350 transitions. [2024-10-11 16:29:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:29:23,575 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 164 [2024-10-11 16:29:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:23,579 INFO L225 Difference]: With dead ends: 981 [2024-10-11 16:29:23,579 INFO L226 Difference]: Without dead ends: 619 [2024-10-11 16:29:23,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2024-10-11 16:29:23,581 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 536 mSDsluCounter, 2092 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:23,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 2498 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:29:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-11 16:29:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 406. [2024-10-11 16:29:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 401 states have (on average 1.3541147132169575) internal successors, (543), 401 states have internal predecessors, (543), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 549 transitions. [2024-10-11 16:29:23,594 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 549 transitions. Word has length 164 [2024-10-11 16:29:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:23,594 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 549 transitions. [2024-10-11 16:29:23,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 549 transitions. [2024-10-11 16:29:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 16:29:23,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:23,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:23,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 16:29:23,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:23,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:23,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1959166924, now seen corresponding path program 1 times [2024-10-11 16:29:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:23,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382767787] [2024-10-11 16:29:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:29:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:24,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:29:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:29:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382767787] [2024-10-11 16:29:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382767787] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106021964] [2024-10-11 16:29:24,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:24,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:24,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:24,211 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 16:29:24,212 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 16:29:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:24,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 16:29:24,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:24,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:29:24,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:29:24,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2024-10-11 16:29:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:29:25,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:29:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106021964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:29:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2024-10-11 16:29:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547365983] [2024-10-11 16:29:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:25,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:29:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:25,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:29:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:29:25,025 INFO L87 Difference]: Start difference. First operand 406 states and 549 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:25,957 INFO L93 Difference]: Finished difference Result 824 states and 1133 transitions. [2024-10-11 16:29:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:29:25,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 165 [2024-10-11 16:29:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:25,960 INFO L225 Difference]: With dead ends: 824 [2024-10-11 16:29:25,960 INFO L226 Difference]: Without dead ends: 666 [2024-10-11 16:29:25,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:29:25,961 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 473 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:25,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 2009 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:29:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-11 16:29:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 437. [2024-10-11 16:29:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 432 states have (on average 1.3402777777777777) internal successors, (579), 432 states have internal predecessors, (579), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 585 transitions. [2024-10-11 16:29:25,973 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 585 transitions. Word has length 165 [2024-10-11 16:29:25,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:25,973 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 585 transitions. [2024-10-11 16:29:25,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 585 transitions. [2024-10-11 16:29:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 16:29:25,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:25,975 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:25,990 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 16:29:26,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:26,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:26,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:26,176 INFO L85 PathProgramCache]: Analyzing trace with hash 649017456, now seen corresponding path program 1 times [2024-10-11 16:29:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:26,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019674514] [2024-10-11 16:29:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:26,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:26,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 16:29:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:26,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 16:29:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:26,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:29:26,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019674514] [2024-10-11 16:29:26,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019674514] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:26,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624027624] [2024-10-11 16:29:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:26,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:26,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:26,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:29:26,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 16:29:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:27,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 16:29:27,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:27,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:29:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624027624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:29:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-11 16:29:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331674362] [2024-10-11 16:29:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:27,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:27,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:27,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:29:27,131 INFO L87 Difference]: Start difference. First operand 437 states and 585 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:27,232 INFO L93 Difference]: Finished difference Result 830 states and 1123 transitions. [2024-10-11 16:29:27,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:27,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 166 [2024-10-11 16:29:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:27,235 INFO L225 Difference]: With dead ends: 830 [2024-10-11 16:29:27,235 INFO L226 Difference]: Without dead ends: 437 [2024-10-11 16:29:27,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:29:27,236 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 17 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:27,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1127 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:29:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-11 16:29:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-10-11 16:29:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 432 states have (on average 1.3356481481481481) internal successors, (577), 432 states have internal predecessors, (577), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 583 transitions. [2024-10-11 16:29:27,250 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 583 transitions. Word has length 166 [2024-10-11 16:29:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:27,250 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 583 transitions. [2024-10-11 16:29:27,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 583 transitions. [2024-10-11 16:29:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 16:29:27,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:27,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:27,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 16:29:27,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:27,457 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:27,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash 224944854, now seen corresponding path program 1 times [2024-10-11 16:29:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576231628] [2024-10-11 16:29:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:27,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 16:29:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:27,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 16:29:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:27,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:27,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576231628] [2024-10-11 16:29:27,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576231628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:27,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:27,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:29:27,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811045081] [2024-10-11 16:29:27,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:27,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:29:27,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:27,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:29:27,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:29:27,809 INFO L87 Difference]: Start difference. First operand 437 states and 583 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:28,109 INFO L93 Difference]: Finished difference Result 835 states and 1130 transitions. [2024-10-11 16:29:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:29:28,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-10-11 16:29:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:28,112 INFO L225 Difference]: With dead ends: 835 [2024-10-11 16:29:28,112 INFO L226 Difference]: Without dead ends: 445 [2024-10-11 16:29:28,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:29:28,113 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 10 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:28,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1829 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:29:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-11 16:29:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 443. [2024-10-11 16:29:28,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 438 states have (on average 1.3310502283105023) internal successors, (583), 438 states have internal predecessors, (583), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 589 transitions. [2024-10-11 16:29:28,125 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 589 transitions. Word has length 167 [2024-10-11 16:29:28,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:28,125 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 589 transitions. [2024-10-11 16:29:28,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 589 transitions. [2024-10-11 16:29:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:29:28,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:28,127 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:28,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:29:28,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:28,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash -222150697, now seen corresponding path program 1 times [2024-10-11 16:29:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321555277] [2024-10-11 16:29:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:28,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:29:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:29:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321555277] [2024-10-11 16:29:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321555277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:28,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:29:28,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015929850] [2024-10-11 16:29:28,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:28,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:29:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:29:28,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:29:28,414 INFO L87 Difference]: Start difference. First operand 443 states and 589 transitions. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:28,787 INFO L93 Difference]: Finished difference Result 841 states and 1134 transitions. [2024-10-11 16:29:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:29:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:29:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:28,790 INFO L225 Difference]: With dead ends: 841 [2024-10-11 16:29:28,790 INFO L226 Difference]: Without dead ends: 455 [2024-10-11 16:29:28,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:29:28,791 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 14 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2474 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:28,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2474 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:29:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-10-11 16:29:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 451. [2024-10-11 16:29:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 446 states have (on average 1.3295964125560538) internal successors, (593), 446 states have internal predecessors, (593), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 599 transitions. [2024-10-11 16:29:28,808 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 599 transitions. Word has length 168 [2024-10-11 16:29:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:28,808 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 599 transitions. [2024-10-11 16:29:28,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 599 transitions. [2024-10-11 16:29:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 16:29:28,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:28,810 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:28,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:29:28,810 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:28,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash -853712781, now seen corresponding path program 1 times [2024-10-11 16:29:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:28,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855908305] [2024-10-11 16:29:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:29,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:29:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:29:29,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855908305] [2024-10-11 16:29:29,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855908305] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225177241] [2024-10-11 16:29:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:29,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:29,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:29,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:29:29,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 16:29:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:29,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 16:29:29,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:29:29,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:29:29,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225177241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:29,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:29:29,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-10-11 16:29:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214636106] [2024-10-11 16:29:29,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:29,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:29:29,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:29,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:29:29,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:29:29,560 INFO L87 Difference]: Start difference. First operand 451 states and 599 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:29,824 INFO L93 Difference]: Finished difference Result 644 states and 870 transitions. [2024-10-11 16:29:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:29:29,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2024-10-11 16:29:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:29,826 INFO L225 Difference]: With dead ends: 644 [2024-10-11 16:29:29,826 INFO L226 Difference]: Without dead ends: 486 [2024-10-11 16:29:29,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:29:29,827 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 34 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:29,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1730 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:29:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-11 16:29:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 478. [2024-10-11 16:29:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 473 states have (on average 1.3234672304439747) internal successors, (626), 473 states have internal predecessors, (626), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 632 transitions. [2024-10-11 16:29:29,842 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 632 transitions. Word has length 168 [2024-10-11 16:29:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:29,842 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 632 transitions. [2024-10-11 16:29:29,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 632 transitions. [2024-10-11 16:29:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 16:29:29,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:29,844 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:29,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 16:29:30,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 16:29:30,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1932942076, now seen corresponding path program 1 times [2024-10-11 16:29:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458438508] [2024-10-11 16:29:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:29:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:29:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:30,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458438508] [2024-10-11 16:29:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458438508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:30,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:30,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:29:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594082239] [2024-10-11 16:29:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:30,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:29:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:30,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:29:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:29:30,341 INFO L87 Difference]: Start difference. First operand 478 states and 632 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:30,821 INFO L93 Difference]: Finished difference Result 671 states and 904 transitions. [2024-10-11 16:29:30,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:29:30,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 169 [2024-10-11 16:29:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:30,823 INFO L225 Difference]: With dead ends: 671 [2024-10-11 16:29:30,824 INFO L226 Difference]: Without dead ends: 486 [2024-10-11 16:29:30,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:29:30,824 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 10 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:30,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1904 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:29:30,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-11 16:29:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 482. [2024-10-11 16:29:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 477 states have (on average 1.3228511530398324) internal successors, (631), 477 states have internal predecessors, (631), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 637 transitions. [2024-10-11 16:29:30,836 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 637 transitions. Word has length 169 [2024-10-11 16:29:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:30,836 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 637 transitions. [2024-10-11 16:29:30,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 637 transitions. [2024-10-11 16:29:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 16:29:30,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:30,838 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:30,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 16:29:30,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:30,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:30,838 INFO L85 PathProgramCache]: Analyzing trace with hash 815608908, now seen corresponding path program 1 times [2024-10-11 16:29:30,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084943413] [2024-10-11 16:29:30,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:31,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:31,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:29:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:31,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:29:31,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:31,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084943413] [2024-10-11 16:29:31,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084943413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:31,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:31,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:29:31,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934064930] [2024-10-11 16:29:31,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:31,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:29:31,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:31,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:29:31,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:29:31,120 INFO L87 Difference]: Start difference. First operand 482 states and 637 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:32,369 INFO L93 Difference]: Finished difference Result 684 states and 922 transitions. [2024-10-11 16:29:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:29:32,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-10-11 16:29:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:32,372 INFO L225 Difference]: With dead ends: 684 [2024-10-11 16:29:32,372 INFO L226 Difference]: Without dead ends: 495 [2024-10-11 16:29:32,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:29:32,372 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 14 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:32,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2172 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 16:29:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-11 16:29:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 490. [2024-10-11 16:29:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.3237113402061855) internal successors, (642), 485 states have internal predecessors, (642), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 648 transitions. [2024-10-11 16:29:32,397 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 648 transitions. Word has length 170 [2024-10-11 16:29:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:32,397 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 648 transitions. [2024-10-11 16:29:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 648 transitions. [2024-10-11 16:29:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 16:29:32,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:32,400 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:32,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 16:29:32,400 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:32,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash -939539152, now seen corresponding path program 1 times [2024-10-11 16:29:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:32,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201492734] [2024-10-11 16:29:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:29:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:32,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:29:32,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201492734] [2024-10-11 16:29:32,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201492734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:32,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515508100] [2024-10-11 16:29:32,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:32,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:32,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:32,729 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:29:32,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 16:29:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:33,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 16:29:33,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:29:33,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:29:33,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515508100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:33,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:29:33,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-11 16:29:33,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775147382] [2024-10-11 16:29:33,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:33,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:29:33,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:33,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:29:33,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:29:33,332 INFO L87 Difference]: Start difference. First operand 490 states and 648 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:33,789 INFO L93 Difference]: Finished difference Result 694 states and 933 transitions. [2024-10-11 16:29:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:29:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-10-11 16:29:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:33,792 INFO L225 Difference]: With dead ends: 694 [2024-10-11 16:29:33,792 INFO L226 Difference]: Without dead ends: 497 [2024-10-11 16:29:33,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:29:33,793 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 12 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:33,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1832 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:29:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-11 16:29:33,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 490. [2024-10-11 16:29:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.3237113402061855) internal successors, (642), 485 states have internal predecessors, (642), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 648 transitions. [2024-10-11 16:29:33,804 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 648 transitions. Word has length 170 [2024-10-11 16:29:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:33,805 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 648 transitions. [2024-10-11 16:29:33,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 648 transitions. [2024-10-11 16:29:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 16:29:33,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:33,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:33,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 16:29:34,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 16:29:34,008 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:34,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash -369690344, now seen corresponding path program 1 times [2024-10-11 16:29:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:34,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842184615] [2024-10-11 16:29:34,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:34,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:34,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:34,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:29:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:29:34,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:34,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842184615] [2024-10-11 16:29:34,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842184615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:34,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:34,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:29:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678216170] [2024-10-11 16:29:34,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:34,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:29:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:34,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:29:34,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:29:34,330 INFO L87 Difference]: Start difference. First operand 490 states and 648 transitions. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:34,801 INFO L93 Difference]: Finished difference Result 702 states and 945 transitions. [2024-10-11 16:29:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:29:34,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-10-11 16:29:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:34,803 INFO L225 Difference]: With dead ends: 702 [2024-10-11 16:29:34,804 INFO L226 Difference]: Without dead ends: 505 [2024-10-11 16:29:34,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:29:34,804 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 22 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:34,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 2326 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:29:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-10-11 16:29:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 497. [2024-10-11 16:29:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 492 states have (on average 1.3231707317073171) internal successors, (651), 492 states have internal predecessors, (651), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 657 transitions. [2024-10-11 16:29:34,818 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 657 transitions. Word has length 171 [2024-10-11 16:29:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:34,818 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 657 transitions. [2024-10-11 16:29:34,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 9 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 657 transitions. [2024-10-11 16:29:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 16:29:34,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:34,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:34,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 16:29:34,820 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:34,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1055294644, now seen corresponding path program 1 times [2024-10-11 16:29:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:34,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497274769] [2024-10-11 16:29:34,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:34,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:35,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:29:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:29:35,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:35,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497274769] [2024-10-11 16:29:35,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497274769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:35,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20826139] [2024-10-11 16:29:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:35,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:35,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:35,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:29:35,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 16:29:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:35,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 16:29:35,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:29:35,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:29:35,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20826139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:35,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:29:35,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-10-11 16:29:35,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262420063] [2024-10-11 16:29:35,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:35,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:29:35,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:35,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:29:35,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:29:35,536 INFO L87 Difference]: Start difference. First operand 497 states and 657 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:35,924 INFO L93 Difference]: Finished difference Result 713 states and 959 transitions. [2024-10-11 16:29:35,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:29:35,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-10-11 16:29:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:35,926 INFO L225 Difference]: With dead ends: 713 [2024-10-11 16:29:35,926 INFO L226 Difference]: Without dead ends: 509 [2024-10-11 16:29:35,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:29:35,927 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 17 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:35,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1862 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:29:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-11 16:29:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 504. [2024-10-11 16:29:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 499 states have (on average 1.3246492985971945) internal successors, (661), 499 states have internal predecessors, (661), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 667 transitions. [2024-10-11 16:29:35,942 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 667 transitions. Word has length 171 [2024-10-11 16:29:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:35,942 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 667 transitions. [2024-10-11 16:29:35,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 667 transitions. [2024-10-11 16:29:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 16:29:35,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:35,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:35,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 16:29:36,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 16:29:36,145 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:36,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash -220664352, now seen corresponding path program 1 times [2024-10-11 16:29:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:36,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607870124] [2024-10-11 16:29:36,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:36,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:29:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 16:29:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:36,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607870124] [2024-10-11 16:29:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607870124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:36,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:29:36,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:29:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890606335] [2024-10-11 16:29:36,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:36,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:29:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:36,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:29:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:29:36,499 INFO L87 Difference]: Start difference. First operand 504 states and 667 transitions. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:37,211 INFO L93 Difference]: Finished difference Result 726 states and 979 transitions. [2024-10-11 16:29:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 16:29:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 172 [2024-10-11 16:29:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:37,213 INFO L225 Difference]: With dead ends: 726 [2024-10-11 16:29:37,213 INFO L226 Difference]: Without dead ends: 515 [2024-10-11 16:29:37,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:29:37,214 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 25 mSDsluCounter, 2684 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:37,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3097 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 16:29:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-11 16:29:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 507. [2024-10-11 16:29:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 502 states have (on average 1.3227091633466135) internal successors, (664), 502 states have internal predecessors, (664), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 16:29:37,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 670 transitions. [2024-10-11 16:29:37,225 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 670 transitions. Word has length 172 [2024-10-11 16:29:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:37,226 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 670 transitions. [2024-10-11 16:29:37,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 10 states have internal predecessors, (165), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:29:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 670 transitions. [2024-10-11 16:29:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 16:29:37,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:37,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:37,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 16:29:37,227 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:37,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1004197316, now seen corresponding path program 1 times [2024-10-11 16:29:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625474622] [2024-10-11 16:29:37,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:37,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:37,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:37,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 16:29:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 16:29:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625474622] [2024-10-11 16:29:37,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625474622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255571118] [2024-10-11 16:29:37,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:37,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:37,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:37,498 INFO L229 MonitoredProcess]: Starting monitored process 8 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 16:29:37,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 16:29:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:38,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 16:29:38,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:29:38,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:29:38,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255571118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:29:38,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:29:38,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-11 16:29:38,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286472905] [2024-10-11 16:29:38,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:29:38,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:29:38,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:29:38,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:29:38,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:29:38,056 INFO L87 Difference]: Start difference. First operand 507 states and 670 transitions. Second operand has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 16:29:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:29:38,092 INFO L93 Difference]: Finished difference Result 915 states and 1216 transitions. [2024-10-11 16:29:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:29:38,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 172 [2024-10-11 16:29:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:29:38,098 INFO L225 Difference]: With dead ends: 915 [2024-10-11 16:29:38,098 INFO L226 Difference]: Without dead ends: 509 [2024-10-11 16:29:38,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:29:38,099 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 0 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:29:38,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1271 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:29:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-11 16:29:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2024-10-11 16:29:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 503 states have (on average 1.3240556660039762) internal successors, (666), 504 states have internal predecessors, (666), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 16:29:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 673 transitions. [2024-10-11 16:29:38,111 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 673 transitions. Word has length 172 [2024-10-11 16:29:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:29:38,111 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 673 transitions. [2024-10-11 16:29:38,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 16:29:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 673 transitions. [2024-10-11 16:29:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 16:29:38,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:29:38,113 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:29:38,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 16:29:38,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:38,314 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:29:38,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:29:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1448136208, now seen corresponding path program 1 times [2024-10-11 16:29:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:29:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102971161] [2024-10-11 16:29:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:29:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 16:29:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:38,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 16:29:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 16:29:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:29:38,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102971161] [2024-10-11 16:29:38,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102971161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:29:38,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088514449] [2024-10-11 16:29:38,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:29:38,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:29:38,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:29:38,683 INFO L229 MonitoredProcess]: Starting monitored process 9 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 16:29:38,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 16:29:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:29:39,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-11 16:29:39,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:29:39,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 16:29:39,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 16:29:39,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:29:39,428 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-10-11 16:29:39,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-10-11 16:29:39,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-10-11 16:29:39,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 16:29:39,574 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 16:29:39,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-11 16:29:39,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11